A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths (Q4149678): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 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.3230080203 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146277434 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115150493 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The art and theory of dynamic programming / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:49, 12 June 2024
scientific article; zbMATH DE number 3578788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths |
scientific article; zbMATH DE number 3578788 |
Statements
A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths (English)
0 references
1978
0 references
