An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978)
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 permutation graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to find next-to-shortest path on permutation graphs |
scientific article |
Statements
An efficient algorithm to find next-to-shortest path on permutation graphs (English)
0 references
9 November 2009
0 references
design of algorithms
0 references
analysis of algorithms
0 references
shortest paths
0 references
next-to-shortest path
0 references
permutation graphs
0 references
0 references
