Abstract
Chronological interval digraphs are a natural directed analogue of interval graphs. They admit elegant characterizations as well as efficient recognition algorithms. Recently, a generalization of chronological interval digraphs to 2-dimensional space called chronological rectangle digraphs was introduced and studied. Although many interesting properties of chronological rectangle digraphs have been discovered, the most fundamental question of whether this class of digraphs can be recognized in polynomial-time remains unanswered. This is largely due to the lack of a good structural characterization for the class. In this paper, we study chronological rectangle digraphs which are also two-terminal series–parallel. We show that this restricted class of digraphs admits a forbidden induced subdigraph characterization, which leads to a polynomial-time recognition algorithm for this class of digraphs.
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.
