An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1631/jzus.2004.0518 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991472328 / rank | |||
Normal rank | |||
Revision as of 02:49, 20 March 2024
scientific article; zbMATH DE number 5059347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for shortest paths in planar layered digraphs |
scientific article; zbMATH DE number 5059347 |
Statements
An efficient parallel algorithm for shortest paths in planar layered digraphs (English)
0 references
4 October 2006
0 references
