I/O-efficient path traversal in succinct planar graphs (Q521807)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O-efficient path traversal in succinct planar graphs |
scientific article |
Statements
I/O-efficient path traversal in succinct planar graphs (English)
0 references
12 April 2017
0 references
external memory algorithms
0 references
path traversal
0 references
planar graphs
0 references
succinct data structures
0 references
0 references
