An efficient algorithm for shortest paths in vertical and horizontal segments (Q5096942): 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/3-540-63307-3_63 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1600927808 / rank | |||
Normal rank | |||
Revision as of 14:20, 19 March 2024
scientific article; zbMATH DE number 7573291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for shortest paths in vertical and horizontal segments |
scientific article; zbMATH DE number 7573291 |
Statements
An efficient algorithm for shortest paths in vertical and horizontal segments (English)
0 references
19 August 2022
0 references
