Abstract
A path cover of a graph G is a set of vertex-disjoint paths that cover all the vertices of G. An optimal path cover of G is a path cover of minimum cardinality. This problem is known to be NP-complete for arbitrary graphs. We present a linear algorithm for this problem on interval graphs. Given the adjacency lists of an interval graph with n vertices and m edges, our algorithm runs in O( m+ n) time.
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.
