A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. (Q6052038)
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: A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. |
scientific article; zbMATH DE number 7740859
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. |
scientific article; zbMATH DE number 7740859 |
Statements
20 September 2023
0 references
graph algorithms
0 references
approximate all pairs of shortest paths
0 references
distance oracles
0 references
A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. (English)
0 references
