An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027): Difference between revisions
From MaRDI portal
Latest revision as of 21:12, 24 June 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
0 references