A Faster Parameterized Algorithm for Group Feedback Edge Set

DOI10.1007/978-3-662-53536-3_23zbMath1417.05228OpenAlexW2527553453MaRDI QIDQ3181064

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

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

Related Items

A Linear-Time Parameterized Algorithm for Node Unique Label Cover

Cites Work

• Unnamed Item
• On group feedback vertex set parameterized by the size of the cutset
• FPT algorithms for path-transversal and cycle-transversal problems
• Packing cycles with modularity constraints
• Parameterized graph separation problems
• An improved parameterized algorithm for the minimum node multiway cut problem
• Non-zero disjoint cycles in highly connected group labelled graphs
• Excluding a group-labelled graph
• On the notion of balance of a signed graph
• Half-integrality, LP-branching, and FPT Algorithms
• On Multiway Cut Parameterized above Lower Bounds
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions
• The Complexity of Multiterminal Cuts
• Properties of vertex packing and independence system polyhedra
• Faster Parameterized Algorithms Using Linear Programming
• Parameterized Algorithms