Geometric containers for efficient shortest-path computation (Q5718630): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q244219 |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Christos D. Zaroliagis / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CGAL / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GraphML / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AspectC++ / rank | |||
Normal rank | |||
| 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.1145/1064546.1103378 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149964853 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:52, 19 March 2024
scientific article; zbMATH DE number 2247336
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Geometric containers for efficient shortest-path computation |
scientific article; zbMATH DE number 2247336 |
Statements
Geometric containers for efficient shortest-path computation (English)
0 references
16 January 2006
0 references
shortest path routine
0 references
Dijkstra's algorithm
0 references
