Improvements for the thresh X2 shortest path algorithm (Q1093560): 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.1016/0167-6377(87)90053-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024813706 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Polynomially Bounded Shortest Path Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New Polynomial Shortest Path Algorithms and Their Computational Attributes / rank | |||
Normal rank | |||
Latest revision as of 11:58, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improvements for the thresh X2 shortest path algorithm |
scientific article |
Statements
Improvements for the thresh X2 shortest path algorithm (English)
0 references
1987
0 references
The thresh X2 algorithm has been shown to dominate other shortest path algorithms over a wide variety of conditions. When used on random networks which have exponentially or normally distributed edge weights the performance of X2 degrades. We develop techniques which improve X2's performance up to 33\% in these cases.
0 references
thresh X2 algorithm
0 references
shortest path algorithms
0 references
random networks
0 references
