Drawing \(c\)-planar biconnected clustered graphs

DOI10.1016/j.dam.2006.04.044zbMath1118.05022OpenAlexW2018796027MaRDI QIDQ885287

Katsutoshi Kuroya, Hiroshi Nagamochi

Publication date: 8 June 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.044

zbMATH Keywords

algorithmplanar graphgraph drawingdivide-and-conquerclustered graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Straight-Line Rectangular Drawings of Clustered Graphs, Straight-line rectangular drawings of clustered graphs, Convex drawings of hierarchical planar graphs and clustered planar graphs, C-planarity testing of embedded clustered graphs with bounded dual carving-width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs: Theory and algorithms
• A data structure for dynamic trees
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Drawing Clustered Graphs on an Orthogonal Grid
• Drawing graphs. Methods and models
• Planarity for clustered graphs