Graph searching and a min-max theorem for tree-width (Q1325271)
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 searching and a min-max theorem for tree-width |
scientific article; zbMATH DE number 572455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph searching and a min-max theorem for tree-width |
scientific article; zbMATH DE number 572455 |
Statements
Graph searching and a min-max theorem for tree-width (English)
0 references
30 June 1994
0 references
graph searching
0 references
min-max theorem
0 references
tree-decomposition
0 references
screens
0 references
game
0 references
tree-width
0 references
0.91974443
0 references
0.9156196
0 references
0.9147536
0 references
0.9082379
0 references
0.9082379
0 references
0.90495914
0 references
0.90303344
0 references
0.90303344
0 references
