Abstract
In this paper, we present two necessary conditions for recognizing point visibility graphs. We show that this recognition problem lies in PSPACE. We state new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time recognition and reconstruction algorithm. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Ghosh, S. K., & Roy, B. (2014). Some results on point visibility graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8344 LNCS, pp. 163–175). Springer Verlag. https://doi.org/10.1007/978-3-319-04657-0_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
