Approximate shortest paths avoiding a failed vertex: optimal size data structures for unweighted graphs (Q3113776)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5999723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate shortest paths avoiding a failed vertex: optimal size data structures for unweighted graphs |
scientific article; zbMATH DE number 5999723 |
Statements
23 January 2012
0 references
shortest path
0 references
distance
0 references
distance queries
0 references
oracle
0 references
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs (English)
0 references
0.9866073727607728
0 references
0.8181890845298767
0 references
0.8003093004226685
0 references
0.7868351340293884
0 references
