Computing shortest paths in networks derived from recurrence relations (Q1179746)
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: Computing shortest paths in networks derived from recurrence relations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing shortest paths in networks derived from recurrence relations |
scientific article |
Statements
Computing shortest paths in networks derived from recurrence relations (English)
0 references
27 June 1992
0 references
shortest paths in networks
0 references
unidirectional and bidirectional search procedures
0 references
