The shortest path problem on large-scale real-road networks (Q3418206): 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.20131 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4248634500 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3241581 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3128914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Threshold assignment algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3997094 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4843187 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Shortest Path Algorithm for Edge-Sparse Graphs / rank | |||
Normal rank | |||
Revision as of 12:37, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The shortest path problem on large-scale real-road networks |
scientific article |
Statements
The shortest path problem on large-scale real-road networks (English)
0 references
2 February 2007
0 references
shortest path problem
0 references
real-road network
0 references
label setting
0 references
label correcting
0 references
heuristic estimate
0 references
bidirectional search
0 references
graph reduction
0 references
preprocessing
0 references
landmarks
0 references
