FPT algorithms for path-transversal and cycle-transversal problems
From MaRDI portal
Recommendations
Cites work
- Algorithms for Multiterminal Cuts
- An improved parameterized algorithm for the minimum node multiway cut problem
- Approximating unique games
- Finding odd cycle transversals.
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved algorithms for feedback vertex set problems
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Multiway cuts in directed and node weighted graphs
- Non-zero disjoint cycles in highly connected group labelled graphs
- On the power of unique 2-prover 1-round games
- Packing non-zero \(A\)-paths in group-labelled graphs
- Parameterized graph separation problems
- Parametrized complexity theory.
- Paths, Trees, and Flowers
Cited in
(27)- Synchronization problems in computer vision with closed-form solutions
- Half-integrality, LP-branching, and FPT algorithms
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
- What's next? Future directions in parameterized complexity
- Clique Cover and Graph Separation
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- A faster parameterized algorithm for Group Feedback Edge Set
- Designing FPT algorithms for cut problems using randomized contractions
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- On the parameterized complexity of finding separators with non-hereditary properties
- Multi-budgeted directed cuts
- scientific article; zbMATH DE number 7559431 (Why is no real title available?)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
- Parameterized complexity of critical node cuts
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
- An improved FPT algorithm for independent feedback vertex set
- On Weighted Graph Separation Problems and Flow Augmentation
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- Edge bipartization faster than \(2^k\)
- Almost consistent systems of linear equations
- On the parameterized complexity of multiway near-separator
- Flow-augmentation. III: Complexity dichotomy for Boolean CSPS parameterized by the number of unsatisfied constraints
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
- Multi-budgeted directed cuts
This page was built for publication: FPT algorithms for path-transversal and cycle-transversal problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456698)
