Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time (Q4625657)
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: Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time |
scientific article; zbMATH DE number 7029221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time |
scientific article; zbMATH DE number 7029221 |
Statements
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time (English)
0 references
25 February 2019
0 references
approximate shortest paths
0 references
hop sets
0 references
0.94241846
0 references
0.9364405
0 references
0.9284837
0 references
0.9083502
0 references
0.9027235
0 references
0.9017091
0 references
0.8985194
0 references
0.8976573
0 references
0.89351785
0 references
