Edge bipartization faster than \(2^k\)
From MaRDI portal
Publication:666655
DOI10.1007/s00453-017-0319-zzbMath1418.68171OpenAlexW857168178WikidataQ59608568 ScholiaQ59608568MaRDI QIDQ666655
Marcin Pilipczuk, Michał Pilipczuk, Marcin Wrochna
Publication date: 11 March 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0319-z
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- FPT algorithms for path-transversal and cycle-transversal problems
- Exact exponential algorithms.
- Finding odd cycle transversals.
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem
- Half-integrality, LP-branching, and FPT Algorithms
- On Multiway Cut Parameterized above Lower Bounds
- What’s Next? Future Directions in Parameterized Complexity
- Parameterized Approximations via d-Skew-Symmetric Multicut
- Algorithm Engineering for Optimal Graph Bipartization
- Simpler Parameterized Algorithm for OCT
- A Combinatorial Decomposition Theory
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
- Compression via Matroids
- Faster Parameterized Algorithms Using Linear Programming
- On Problems as Hard as CNF-SAT
- The Power of Linear Programming for General-Valued CSPs
- Half-integrality, LP-branching and FPT Algorithms
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
This page was built for publication: Edge bipartization faster than \(2^k\)
