Sharing information for the all pairs shortest path problem (Q391758)
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: Sharing information for the all pairs shortest path problem |
scientific article; zbMATH DE number 6244480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharing information for the all pairs shortest path problem |
scientific article; zbMATH DE number 6244480 |
Statements
Sharing information for the all pairs shortest path problem (English)
0 references
13 January 2014
0 references
information sharing
0 references
all pairs shortest path problem
0 references
single sink shortest path problem
0 references
priority queue
0 references
nearly acyclic graph
0 references
limited edge cost
0 references
0.87400115
0 references
0 references
0.85506344
0 references
0 references
0.8499366
0 references
0.84993577
0 references
0.84042555
0 references
0.83984977
0 references
