Abstract
A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on n vertices contains a feedback vertex set (FVS) of size at most k, in time O(47.5 k ·k! ·n 4). This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs.
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.