Dynamic approximate all-pairs shortest paths in undirected graphs (Q2910856)
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: Dynamic approximate all-pairs shortest paths in undirected graphs |
scientific article; zbMATH DE number 6081209
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic approximate all-pairs shortest paths in undirected graphs |
scientific article; zbMATH DE number 6081209 |
Statements
12 September 2012
0 references
approximate all-pairs shortest paths problem
0 references
unweighted undirected graphs
0 references
dynamic algorithms
0 references
Dynamic approximate all-pairs shortest paths in undirected graphs (English)
0 references
