FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
From MaRDI portal
Publication:3503584
DOI10.1007/978-3-540-79723-4_13zbMath1142.68599MaRDI QIDQ3503584
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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Multicut Is FPT, Unnamed Item, Simple and improved parameterized algorithms for multiterminal cuts, The critical node detection problem in networks: a survey, On Multiway Cut Parameterized above Lower Bounds, Subset Feedback Vertex Set Is Fixed-Parameter Tractable
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