A subquadratic-time algorithm for decremental single-source shortest paths (Q5384041)
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 subquadratic-time algorithm for decremental single-source shortest paths |
scientific article; zbMATH DE number 7069397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subquadratic-time algorithm for decremental single-source shortest paths |
scientific article; zbMATH DE number 7069397 |
Statements
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths (English)
0 references
20 June 2019
0 references
0.9014262557029724
0 references
0.8917256593704224
0 references
0.8857895731925964
0 references
0.8857092261314392
0 references
0.8725565671920776
0 references
