Odd cycle transversal in mixed graphs
From MaRDI portal
Publication:2672431
DOI10.1007/978-3-030-86838-3_10OpenAlexW3200840537MaRDI QIDQ2672431
Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh, Avinandan Das
Publication date: 8 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86838-3_10
Cites Work
- Unnamed Item
- Unnamed Item
- On feedback vertex set: new measure and new structures
- Finding odd cycle transversals.
- Parameterized graph separation problems
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Improved algorithms for feedback vertex set problems
- Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9--15, 2000. Proceedings
- Faster deterministic \textsc{Feedback Vertex Set}
- An improved parameterized algorithm for the minimum node multiway cut problem
- Half-integrality, LP-branching, and FPT Algorithms
- On Multiway Cut Parameterized above Lower Bounds
- Faster Parameterized Algorithms Using Linear Programming
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
- Feedback Vertex Set in Mixed Graphs
- Linear-Time FPT Algorithms via Network Flow
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
This page was built for publication: Odd cycle transversal in mixed graphs
