An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479)
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: An efficient time and space K point-to-point shortest simple paths algorithm |
scientific article; zbMATH DE number 6074615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient time and space \(K\) point-to-point shortest simple paths algorithm |
scientific article; zbMATH DE number 6074615 |
Statements
An efficient time and space \(K\) point-to-point shortest simple paths algorithm (English)
0 references
30 August 2012
0 references
ranking best solutions
0 references
point-to-point shortest paths
0 references
\(K\) best shortest simple paths
0 references
0 references
0.8668003082275391
0 references
0.8628942370414734
0 references
0.861082911491394
0 references
0.8461183905601501
0 references
