Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs |
scientific article |
Statements
Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (English)
0 references
16 May 2013
0 references
shortest path
0 references
distance
0 references
approximate distance
0 references
oracle
0 references
