Seeing Arboretum for the (partial k-) Trees
From MaRDI portal
Publication:5042445
DOI10.1007/978-3-030-42071-0_1OpenAlexW3018858735MaRDI QIDQ5042445
Stefan Arnborg, Andrzej Proskurowski
Publication date: 19 October 2022
Published in: Treewidth, Kernels, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42071-0_1
Cites Work
- Forbidden minors characterization of partial 3-trees
- A partial k-arboretum of graphs with bounded treewidth
- Improved self-reduction algorithms for graphs with bounded treewidth
- Tree decompositions with small cost
- Easy problems for tree-decomposable graphs
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Characterization and Recognition of Partial 3-Trees
- Complexity of Finding Embeddings in a k-Tree
- Computing the Minimum Fill-In is NP-Complete
- A linear time algorithm for finding tree-decompositions of small treewidth
- Encyclopedia of Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Seeing Arboretum for the (partial k-) Trees
