I/O-efficient algorithms for graphs of bounded treewidth (Q2768277)
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 1699208
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O-efficient algorithms for graphs of bounded treewidth |
scientific article; zbMATH DE number 1699208 |
Statements
24 March 2002
0 references
I/O-efficient algorithms
0 references
shortest path problem
0 references
graphs
0 references
bounded treewidth
0 references
I/O-efficient algorithms for graphs of bounded treewidth (English)
0 references
