Compact Visibility Representation of Plane Graphs

Jiun-Jie Wang & Xin He
The visibility representation (VR for short) is a classical representation of plane graphs. It 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 grid of size at least (2/3)n x((4/3)n-3) (width x height). For upper bounds, it is known that every plane...
This data center is not currently reporting usage information. For information on how your repository can submit usage information, please see our Documentation.