Convex drawings of hierarchical planar graphs and clustered planar graphs
From MaRDI portal
Publication:988690
DOI10.1016/j.jda.2009.05.003zbMath1231.05184MaRDI QIDQ988690
Seok-Hee Hong, Hiroshi Nagamochi
Publication date: 18 August 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.05.003
graph drawing; convex drawing; triconnected planar graphs; straight-line drawing; clustered graphs; hierarchical graphs
05C10: Planar graphs; geometric and topological aspects of graph theory
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
How to Morph Planar Graph Drawings, Upward planar morphs, Convexity-increasing morphs of planar graphs, Upward planar morphs, Planar and Toroidal Morphs Made Easier, The segment number: algorithms and universal lower bounds for some classes of planar graphs, Morphing planar graph drawings through 3D, Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, An algorithm for constructing star-shaped drawings of plane graphs, C-planarity testing of embedded clustered graphs with bounded dual carving-width, Planar and toroidal morphs made easier, On planar greedy drawings of 3-connected planar graphs, A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Drawing \(c\)-planar biconnected clustered graphs
- Convex drawings of graphs with non-convex boundary constraints
- Computing an st-numbering
- Completely connected clustered graphs
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Bemerkungen zum Vierfarbenproblem
- Convex Representations of Graphs
- Convex Grid Drawings of Plane Graphs with Rectangular Contours
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- How to Draw a Graph
- Drawing graphs. Methods and models