Contraction and treewidth lower bounds
From MaRDI portal
Recommendations
Cited in
(9)- The complexity of degree anonymization by graph contractions
- Tree decomposition and discrete optimization problems: a survey
- An Experimental Study of the Treewidth of Real-World Graph Data
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- Contraction and Treewidth Lower Bounds
- Searching for a Visible, Lazy Fugitive
- Treewidth computations. II. Lower bounds
- Achievable sets, brambles, and sparse treewidth obstructions
- Treewidth lower bounds with brambles
This page was built for publication: Contraction and treewidth lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464620)