On the complexity of computing treebreadth (Q1987233)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7189176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing treebreadth |
scientific article; zbMATH DE number 7189176 |
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
0.997303307056427
0 references
0.8328076601028442
0 references
0.8054773807525635
0 references
0.8053948283195496
0 references
0.79527747631073
0 references
