Simultaneous Graph Embeddings with Fixed Edges
暂无分享,去创建一个
[1] Jan Kratochvíl,et al. Noncrossing Subgraphs in Topological Layouts , 1991, SIAM J. Discret. Math..
[2] Marcus Schaefer,et al. Recognizing string graphs in NP , 2002, STOC '02.
[3] Michael Kaufmann,et al. Two Trees Which Are Self-intersecting When Drawn Simultaneously , 2005, Graph Drawing.
[4] Stephen G. Kobourov,et al. Simultaneous Embedding of a Planar Graph and Its Dual on the Grid , 2005, Theory of Computing Systems.
[5] Stephen G. Kobourov,et al. An Interactive Multi-user System for Simultaneous Graph Drawing , 2004, Graph Drawing.
[6] Stephen G. Kobourov,et al. Simultaneous Embedding of Planar Graphs with Few Bends , 2004, Graph Drawing.
[7] Emilio Di Giacomo,et al. A note on simultaneous embedding of planar graphs , 2005, EuroCG.
[8] Armand Navabi,et al. Journal of Graph Algorithms and Applications Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes , 2022 .
[9] Jan Kratochvíl,et al. String graphs. II. recognizing string graphs is NP-hard , 1991, J. Comb. Theory, Ser. B.
[10] Joseph S. B. Mitchell,et al. On Simultaneous Planar Graph Embeddings , 2003, WADS.
[11] Jan Kratochvíl,et al. Crossing Number of Abstract Topological Graphs , 1998, GD.