An FPT algorithm for edge subset feedback edge set

DOI10.1016/J.IPL.2011.10.007zbMATH Open1233.68142OpenAlexW2077630031MaRDI QIDQ763477FDOQ763477

Authors: Mingyu Xiao, Hiroshi Nagamochi 

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

Recommendations

• Subset feedback vertex set is fixed-parameter tractable
• Subset feedback vertex set is fixed-parameter tractable
• Algorithms and Data Structures
• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
• Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}

zbMATH Keywords

graph algorithmsfixed-parameter tractablefeedback setedge feedback set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Subset feedback vertex set is fixed-parameter tractable
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Title not available (Why is that?)
• Improved algorithms for feedback vertex set problems
• Simple and improved parameterized algorithms for multiterminal cuts
• Approximating minimum feedback sets and multicuts in directed graphs
• Title not available (Why is that?)
• An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

Cited In (6)

• Title not available (Why is that?)
• FPT algorithms for connected feedback vertex set
• A survey of parameterized algorithms and the complexity of edge modification
• Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time
• Covering Vectors by Spaces: Regular Matroids
• Title not available (Why is that?)

This page was built for publication: An FPT algorithm for edge subset feedback edge set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763477)