scientific article; zbMATH DE number 7764094
From MaRDI portal
Publication:6068237
DOI10.4230/lipics.ipec.2020.3arXiv2007.14179MaRDI QIDQ6068237
No author found.
Publication date: 13 November 2023
Full work available at URL: https://arxiv.org/abs/2007.14179
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treewidthparameterized algorithmsgraph modificationvertex deletion problemssubset feedback vertex setmultiway cut
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (3)
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs ⋮ Computing subset transversals in \(H\)-free graphs ⋮ Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
Cites Work
- Unnamed Item
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- Primal-dual approximation algorithms for integral flow and multicut in trees
- On the computational complexity of vertex integrity and component order connectivity
- An FPT algorithm for edge subset feedback edge set
- On directed feedback vertex set parameterized by treewidth
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Planar graph bipartization in linear time
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Tight Lower Bounds on Graph Embedding Problems
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
- Slightly Superexponential Parameterized Problems
- On the complexity of \(k\)-SAT
This page was built for publication:
