Academic Journal
A linear-processor polylog-time algorithm for shortest paths in planar graphs
| Title: | A linear-processor polylog-time algorithm for shortest paths in planar graphs |
|---|---|
| Authors: | Philip N. Klein, Sairam Subramaniany |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps. |
| Publication Year: | 1993 |
| Collection: | CiteSeerX |
| Document Type: | text |
| File Description: | application/postscript |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6410; http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6410 http://www.cs.brown.edu/people/pnk/publications/1993parPlanarShort.ps |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.6B231033 |
| Database: | BASE |
| Description not available. |