I/O and Space-Efficient Path Traversal in Planar Graphs (Q3652302)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O and Space-Efficient Path Traversal in Planar Graphs |
scientific article |
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
