Abstract
Trapezoid graphs are extensions of interval graphs and permutation graphs. This paper presents an O(¦V¦) time algorithm for finding a minimum cardinality Steiner set and an O(¦E¦ + ¦V¦) time algorithm for finding a minimum cardinality connected dominating set in a trapezoid graph G = ( V, E), given the trapezoid diagram.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.