On the complexity of computing treebreadth (Q1987233)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing treebreadth |
scientific article |
Statements
On the complexity of computing treebreadth (English)
0 references
14 April 2020
0 references
treebreadth
0 references
pathlength
0 references
pathbreadth
0 references
Robertson and Seymour's tree decomposition
0 references
planar graphs
0 references
bipartite graphs
0 references
NP-completeness
0 references
graph theory
0 references
0 references
0 references
0 references
