FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs

DOI10.1007/978-3-540-79723-4_13zbMath1142.68599OpenAlexW1586475286MaRDI QIDQ3503584

Sylvain Guillemot

Publication date: 5 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_13

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

On Multiway Cut Parameterized above Lower Bounds ⋮ Multicut Is FPT ⋮ Subset Feedback Vertex Set Is Fixed-Parameter Tractable ⋮ The critical node detection problem in networks: a survey ⋮ Simple and improved parameterized algorithms for multiterminal cuts ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Finding odd cycle transversals.
• Parameterized graph separation problems
• Packing non-zero \(A\)-paths in group-labelled graphs
• Parametrized complexity theory.
• On the power of unique 2-prover 1-round games
• Approximating unique games
• An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
• Multiway cuts in directed and node weighted graphs

This page was built for publication: FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs