Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703)
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: Algorithms for graphs of bounded treewidth via orthogonal range searching |
scientific article; zbMATH DE number 5595368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for graphs of bounded treewidth via orthogonal range searching |
scientific article; zbMATH DE number 5595368 |
Statements
Algorithms for graphs of bounded treewidth via orthogonal range searching (English)
0 references
14 August 2009
0 references
dilation
0 references
average distance
0 references
Wiener index
0 references
treewidth
0 references
orthogonal range searching
0 references
geometric graph
0 references
0.9136076
0 references
0.9136076
0 references
0.9101877
0 references
0.9101877
0 references
0.9028257
0 references
0.8990298
0 references
