Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348)
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: Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction |
scientific article; zbMATH DE number 5566995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction |
scientific article; zbMATH DE number 5566995 |
Statements
Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (English)
0 references
22 June 2009
0 references
graph minors
0 references
graph algorithms
0 references
grid graphs
0 references
treewidth
0 references
bidimensionality
0 references
Wagner's conjecture
0 references
0 references
0 references
0 references
0.9884893894195556
0 references
0.8474434614181519
0 references
0.8330133557319641
0 references
0.821583092212677
0 references
0.8183404803276062
0 references
