A NEW METHOD FINDING THE K-TH BEST PATH IN A GRAPH (Q4175586)
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 NEW METHOD FINDING THE K-TH BEST PATH IN A GRAPH |
scientific article; zbMATH DE number 3609707
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A NEW METHOD FINDING THE K-TH BEST PATH IN A GRAPH |
scientific article; zbMATH DE number 3609707 |
Statements
A NEW METHOD FINDING THE K-TH BEST PATH IN A GRAPH (English)
0 references
1979
0 references
Connected
0 references
K-Best Path
0 references
Single
0 references
Nonoriented
0 references
Efficiency of the Algorithm
0 references
