An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_58 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1534329287 / rank | |||
Normal rank | |||
Revision as of 21:18, 19 March 2024
scientific article; zbMATH DE number 5279489
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane |
scientific article; zbMATH DE number 5279489 |
Statements
An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (English)
0 references
27 May 2008
0 references
