An efficient algorithm to find next-to-shortest path on trapezoid graphs (Q3639634)
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 algorithm to find next-to-shortest path on trapezoid graphs |
scientific article; zbMATH DE number 5620297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to find next-to-shortest path on trapezoid graphs |
scientific article; zbMATH DE number 5620297 |
Statements
23 October 2009
0 references
design of algorithms
0 references
analysis of algorithms
0 references
shortest paths
0 references
next-to-shortest path
0 references
trapezoid graphs
0 references
0.8439199328422546
0 references
0.8435921669006348
0 references
0.8402013182640076
0 references
0.8370641469955444
0 references
0.8326427340507507
0 references
