Compact visibility representation of 4-connected plane graphs
From MaRDI portal
Publication:443715
DOI10.1016/j.tcs.2012.02.010zbMath1246.05108MaRDI QIDQ443715
Huaming Zhang, Jiun-Jie Wang, Xin He
Publication date: 13 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.010
05C10: Planar graphs; geometric and topological aspects of graph theory
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
The partial visibility representation extension problem, Skyscraper polytopes and realizations of plane triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Improved visibility representation of plane graphs
- Algorithms for computing a parameterized \(st\)-orientation
- Optimal \(st\)-orientations for plane triangulations
- Visibility representation of plane graphs via canonical ordering tree
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- On triangulating planar graphs under the four-connectivity constraint
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Canonical ordering trees and their applications in graph drawing
- NP-completeness of st-orientations for plane graphs
- Parameterized st-Orientations of Graphs: Algorithms and Experiments
- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- Width-Optimal Visibility Representations of Plane Graphs
- Graph Drawing
- Graph Drawing
- Nearly Optimal Visibility Representations of Plane Graphs
