Computing shortest paths in networks derived from recurrence relations (Q1179746): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:35, 4 March 2024
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
