Drawing planar partitions I: LL-drawings and LH-drawings
暂无分享,去创建一个
[1] Brendan D. McKay,et al. On an edge crossing problem , 1986 .
[2] Michael Kaufmann,et al. Nice Drawings for Planar Bipartite Graphs , 1997, CIAC.
[3] Roberto Tamassia,et al. On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..
[4] Norishige Chiba,et al. Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..
[5] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..
[6] M. Chrobak,et al. Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..
[7] Michael Kaufmann,et al. Drawing Planar Partitions II: HH-Drawings , 1998, WG.
[8] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..
[9] Michael Jünger,et al. Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .
[10] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.
[11] J. Davenport. Editor , 1960 .
[12] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[13] Ashim Garg,et al. Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs , 1994, GD.
[14] Goos Kant,et al. On Triangulating Planar Graphs under the Four-Connectivity Constraint , 1994, Algorithmica.