A faster parameterized algorithm for Group Feedback Edge Set

DOI10.1007/978-3-662-53536-3_23MaRDI QIDQ3181064zbMATH OpenOpenAlexFDO

Authors M. S. Ramanujan

Publication date 22 December 2016

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53536-3_23

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Simultaneous feedback edge set: a parameterized perspective
• Algorithms and Data Structures
• Simultaneous feedback edge set: a parameterized perspective

Cites work

• An improved parameterized algorithm for the minimum node multiway cut problem
• Designing FPT algorithms for cut problems using randomized contractions
• Excluding a group-labelled graph
• Faster parameterized algorithms using linear programming
• FPT algorithms for path-transversal and cycle-transversal problems
• Half-integrality, LP-branching, and FPT algorithms
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Non-zero disjoint cycles in highly connected group labelled graphs
• On the notion of balance of a signed graph
• Packing cycles with modularity constraints
• Parameterized algorithms
• Parameterized graph separation problems
• Properties of vertex packing and independence system polyhedra
• The Complexity of Multiterminal Cuts

Cited in

(1)

• A Linear-Time Parameterized Algorithm for Node Unique Label Cover

This page was built for publication: A faster parameterized algorithm for Group Feedback Edge Set

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