Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751)
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: Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs |
scientific article; zbMATH DE number 6163654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs |
scientific article; zbMATH DE number 6163654 |
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
0 references
0.9866073727607728
0 references
0.8250076770782471
0 references
0.8071476221084595
0 references
