Abstract
The 3-path vertex cover problem is an extension of the well-known vertex cover problem. It asks for a vertex set S⊆V(G) of minimum cardinality such that G−S only contains independent vertices and edges. In this paper we will present a polynomial algorithm which computes two disjoint sets T1,T2 of vertices of G such that (i) for any 3-path vertex cover S′ in G[T2], S′∪T1 is a 3-path vertex cover in G, (ii) there exists a minimum 3-path vertex cover in G which contains T1 and (iii) |T2|≤6⋅ψ3(G[T2]), where ψ3(G) is the cardinality of a minimum 3-path vertex cover and T2 is the kernel of G.
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.
