Graph minors. II. Algorithmic aspects of tree-width (Q3751592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph minors. II. Algorithmic aspects of tree-width |
scientific article; zbMATH DE number 3987295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph minors. II. Algorithmic aspects of tree-width |
scientific article; zbMATH DE number 3987295 |
Statements
Graph minors. II. Algorithmic aspects of tree-width (English)
0 references
1986
0 references
contractability
0 references
tree-width
0 references
polynomially bounded algorithm
0 references
planar graph
0 references
polynomial algorithm
0 references
0.8504052758216858
0 references
0.8423845767974854
0 references
