Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
SIAM Journal on Discrete Mathematics
Canonical Ordering Trees and Their Applications in Graph Drawing
Discrete & Computational Geometry
Improved visibility representation of plane graphs
Computational Geometry: Theory and Applications
Visibility representation of plane graphs via canonical ordering tree
Information Processing Letters
Parameterized st-orientations of graphs: algorithms and experiments
GD'06 Proceedings of the 14th international conference on Graph drawing
Width-optimal visibility representations of plane graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Applications of parameterized st-orientations in graph drawing algorithms
GD'05 Proceedings of the 13th international conference on Graph Drawing
An application of well-orderly trees in graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Nearly optimal visibility representations of plane graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hi-index | 0.00 |
The visibility representation (VR for short) is a classical representation of plane graphs. The VR has various applications and has been extensively studied. A main focus of the study is to minimize the size of the VR. It is known that there exists a plane graph G with n vertices where any VR of G requires a size at least ⌊2n/3⌋ × (⌊4n/3⌋-3). For upper bounds, it is known that every plane graph has a VR with size at most ⌊2/3n⌋ × (2n - 5), and a VR with size at most (n - 1) × ⌊4/3n⌋. It has been an open problem to find a VR with both height and width simultaneously bounded away from the trivial upper bounds (namely of size chn×cwn with ch cw n/4 + 2⌈√n⌉ + 4 and width ≤ ⌈3n/2⌉. Our VR algorithm is based on an st-orientation of 4-connected plane graphs with special properties. Since the st-orientation is a very useful concept in other applications, this result may be of independent interests.