I/O-efficient algorithms for graphs of bounded treewidth (Q834592)
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: I/O-efficient algorithms for graphs of bounded treewidth |
scientific article; zbMATH DE number 5598785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O-efficient algorithms for graphs of bounded treewidth |
scientific article; zbMATH DE number 5598785 |
Statements
I/O-efficient algorithms for graphs of bounded treewidth (English)
0 references
27 August 2009
0 references
algorithms
0 references
external memory algorithms
0 references
bounded treewidth
0 references
graph algorithms
0 references
1.0000004
0 references
0.92255735
0 references
0.92255735
0 references
0.9211134
0 references
0.9124254
0 references
0.91093236
0 references
0.9101877
0 references
0.90896434
0 references
0.90896434
0 references
