Edge Intersection Graphs of L-Shaped Paths in Grids
Kathie Cameron, Steven Chaplick, Ch\'inh T. Ho\`ang

TL;DR
This paper studies specific subclasses of edge intersection graphs of L-shaped paths on grids, proving NP-completeness for membership testing and providing characterizations and algorithms for certain subclasses.
Contribution
It introduces and analyzes subclasses of $B_1$-EPG graphs based on L-shape shapes, proving NP-completeness and offering recognition algorithms for some subclasses.
Findings
Testing membership in subclasses is NP-complete.
Strict inclusions and incomparability among subclasses are established.
Polytime algorithms are provided for recognizing certain subclasses.
Abstract
In this paper we continue the study of the edge intersection graphs of one (or zero) bend paths on a rectangular grid. That is, the edge intersection graphs where each vertex is represented by one of the following shapes: ,, , , and we consider zero bend paths (i.e., | and ) to be degenerate s. These graphs, called -EPG graphs, were first introduced by Golumbic et al (2009). We consider the natural subclasses of -EPG formed by the subsets of the four single bend shapes (i.e., {}, {,}, {,}, and {,,}) and we denote the classes by [], [,], [,], and [,,] respectively. Note: all other subsets are isomorphic to these up to 90 degree rotation. We show…
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.
