I/O-efficient path traversal in succinct planar graphs (Q521807)
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 path traversal in succinct planar graphs |
scientific article; zbMATH DE number 6705190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O-efficient path traversal in succinct planar graphs |
scientific article; zbMATH DE number 6705190 |
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
0.9718416
0 references
0.92271954
0 references
0.92271954
0 references
0.8973162
0 references
0.8873482
0 references
0.88591707
0 references
0 references
