An FPT algorithm for edge subset feedback edge set
From MaRDI portal
Publication:763477
DOI10.1016/j.ipl.2011.10.007zbMath1233.68142OpenAlexW2077630031MaRDI QIDQ763477
Hiroshi Nagamochi, Mingyu Xiao
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.007
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Covering Vectors by Spaces: Regular Matroids, A survey of parameterized algorithms and the complexity of edge modification, Unnamed Item, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Improved algorithms for feedback vertex set problems
- Simple and improved parameterized algorithms for multiterminal cuts
- Approximating minimum feedback sets and multicuts in directed graphs
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- A fixed-parameter algorithm for the directed feedback vertex set problem
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem