Abstract

Feedback vertex set (FVS) problem is a classical NP-complete problem.There are important applications of the problem in many areas.Many studies have been done on the FVS problem,but there is no effective algorithm to enumerate the FVS in weighted undirected graphs.In this paper,a fixed-parameter enumeration algorithm based on the branch-and-search technique is given by analyzing the structure of the FVS problem in weighted undirected graphs.In the algorithm,the feedback vertex set problem is transformed to feedback edge set (FES) problem and the z minimum-weight FES of size k are enumerated by enumerating z maximum-weight forests,then the z minimum-weight FVS of size k can be found.The fixed-parameter enumeration algorithm for FVS runs in time O(5kn2(logn+k)+3kz(n2logn+z)).

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.