Algorithms, Complexity, and Hans
From MaRDI portal
Publication:5042448
DOI10.1007/978-3-030-42071-0_4OpenAlexW3017987756MaRDI QIDQ5042448
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_4
algorithmscomputational complexitynetworkstreewidthgraphsparameterized complexitystructural algorithmics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infeasibility of instance compression and succinct PCPs for NP
- On problems without polynomial kernels
- Graph minors. I. Excluding a forest
- Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
- On interval routing schemes and treewidth
- Graph minors. II. Algorithmic aspects of tree-width
- Simulation of large networks on smaller networks
- Diameter increase caused by edge deletion
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- NC-algorithms for graphs with small treewidth
This page was built for publication: Algorithms, Complexity, and Hans
