I/O and space-efficient path traversal in planar graphs (Q3652302)
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 and space-efficient path traversal in planar graphs |
scientific article; zbMATH DE number 5649469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O and space-efficient path traversal in planar graphs |
scientific article; zbMATH DE number 5649469 |
Statements
I/O and Space-Efficient Path Traversal in Planar Graphs (English)
0 references
17 December 2009
0 references
representation of bounded-degree planar graphs
0 references
path length
0 references
block size
0 references
triangular-irregular network
0 references
0.9799166321754456
0 references
0.798560380935669
0 references
0.7981559634208679
0 references
0.7909207940101624
0 references
0.7874300479888916
0 references
