Computing twin-width parameterized by the feedback edge number
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7829295 (Why is no real title available?)
- scientific article; zbMATH DE number 7803584 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A single-exponential time 2-approximation algorithm for treewidth
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Deciding twin-width at most 4 is NP-complete
- Fast FPT-approximation of branchwidth
- Finding Branch-Decompositions and Rank-Decompositions
- Fundamentals of parameterized complexity
- Graph minors. II. Algorithmic aspects of tree-width
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Parameterized algorithms
- Parameterized complexity of 1-planarity
- Preprocessing for treewidth: a combinatorial analysis through kernelization
- Rank-width and vertex-minors
- Sparsity. Graphs, structures, and algorithms
- Structure-aware lower bounds and broadening the horizon of tractability for QBF
- The power of cut-based parameters for computing edge-disjoint paths
- Towards a polynomial kernel for directed feedback vertex set
- Treedepth Parameterized by Vertex Cover Number.
- Twin-width IV: ordered graphs and matrices
- Twin-width V: linear minors, modular counting, and matrix multiplication
- Twin-width and polynomial kernels
- Twin-width and transductions of proper k-mixed-thin graphs
- Twin-width. I: Tractable FO model checking
- Twin-width. II: Small classes
- Twin-width. VI: The lens of contraction sequences
- Two-layer planarization parameterized by feedback edge set
- Typical sequences revisited -- computing width parameters of graphs
- Weighted model counting with twin-width
Cited in
(2)
This page was built for publication: Computing twin-width parameterized by the feedback edge number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902719)
