A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees (Q3049827): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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/net.3230090304 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061159212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
Latest revision as of 02:03, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees |
scientific article |
Statements
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees (English)
0 references
1979
0 references
labelling techniques
0 references
shortest path trees
0 references
analysis of algorithms
0 references
