Treewidth parameterized by feedback vertex number
From MaRDI portal
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A linear algorithm for the domination number of a tree
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A naive algorithm for feedback vertex set
- A partial k-arboretum of graphs with bounded treewidth
- Algorithms for generalized stability numbers of tree graphs
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
- An improved parameterized algorithm for treewidth
- An improvement of Reed's treewidth approximation
- Approximation algorithms for treewidth
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Complexity of Finding Embeddings in a k-Tree
- Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Easy problems for tree-decomposable graphs
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Finding all leftmost separators of size \(\le k\)
- Fundamentals of parameterized complexity
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Graph minors. XIII: The disjoint paths problem
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Kernelization. Theory of parameterized preprocessing
- Linear algorithms for edge-coloring trees and unicyclic graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear-time computation of optimal subgraphs of decomposable graphs
- Nonserial dynamic programming
- On the complexity of k-SAT
- Parameterized algorithms
- Parametrized complexity theory.
- Preprocessing for treewidth: a combinatorial analysis through kernelization
- S-functions for graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Treewidth and pathwidth parameterized by the vertex cover number
- Treewidth. Computations and approximations
- Treewidth: Characterizations, Applications, and Computations
- Treewidth: Structure and Algorithms
- Which problems have strongly exponential complexity?
This page was built for publication: Treewidth parameterized by feedback vertex number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397577)
