Abstract

We present an O(n)-time algorithm for the minimum cardinality connected dominating set problem for permutation graphs (given their permutation functions). We also give O(n log n)-time algorithms for the minimum Steiner set and single-source shortest path problems for permutation graphs. Our results improve previously known O(n2)-time algorithms.

Full Text
Paper version not known

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 call

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.