Combinatorial Properties and Recognition of Unit Square Visibility Graphs
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, and Sue Whitesides
TL;DR
This paper explores the combinatorial characteristics of unit square visibility graphs and examines the computational complexity of recognizing and representing these graphs within constrained areas.
Contribution
It provides new insights into the properties of USV and USGV and analyzes the difficulty of recognition problems for these graph classes.
Findings
Identified key combinatorial properties of USV and USGV.
Proved hardness results for recognition problems.
Analyzed constraints for representing these graphs in small areas.
Abstract
Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axis-parallel visibility between unit squares placed (on integer grid coordinates) in the plane. We investigate combinatorial properties of these graph classes and the hardness of variants of the recognition problem, i.e., the problem of representing USGV with fixed visibilities within small area and, for USV, the general recognition problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.