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 B1-EPG graphs, were first introduced by Golumbic et al. (2009). We consider the natural subclasses of B1-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 that testing for membership in each of these classes is NP-complete and observe the expected strict inclusions and incomparability (i.e., [⌞]⊊[⌞,⌜],[⌞,⌝]⊊[⌞,⌜,⌝]⊊B1-EPG and [⌞,⌜] is incomparable with [⌞,⌝]). Additionally, we give characterizations and polytime recognition algorithms for special subclasses of Split ∩[⌞].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
