Shortest‐path methods: Complexity, interrelations and new propositions (Q3706872): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230140206 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062266989 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on Dijkstra's Shortest Path Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Boolean Matrices / rank | |||
Normal rank | |||
Revision as of 09:36, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest‐path methods: Complexity, interrelations and new propositions |
scientific article |
Statements
Shortest‐path methods: Complexity, interrelations and new propositions (English)
0 references
1984
0 references
unified approach
0 references
shortest-path problems
0 references
finite sequence of partial graphs
0 references
computational complexity
0 references
