Dual algorithms for the shortest path tree problem (Q4367280): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Dual algorithms for the shortest path tree problem | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2<125::aid-net7>3.0.co;2-l / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2115847261 / rank | |||
Normal rank | |||
| Property / title | |||
Dual algorithms for the shortest path tree problem (English) | |||
| Property / title: Dual algorithms for the shortest path tree problem (English) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:38, 30 July 2024
scientific article; zbMATH DE number 1091561
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dual algorithms for the shortest path tree problem |
scientific article; zbMATH DE number 1091561 |
Statements
25 November 1997
0 references
shortest path tree problem
0 references
dual ascent algorithms
0 references
parallel implementation
0 references
reoptimization
0 references
Dual algorithms for the shortest path tree problem (English)
0 references
