A faster algorithm for the single source shortest path problem with few distinct positive lengths (Q972360)
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 faster algorithm for the single source shortest path problem with few distinct positive lengths |
scientific article; zbMATH DE number 5711884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for the single source shortest path problem with few distinct positive lengths |
scientific article; zbMATH DE number 5711884 |
Statements
A faster algorithm for the single source shortest path problem with few distinct positive lengths (English)
0 references
25 May 2010
0 references
shortest path problem
0 references
Dijkstra's algorithm
0 references
linear time
0 references
red-blue graphs
0 references
0.807955265045166
0 references
0.7733737230300903
0 references
0.7712104916572571
0 references
