Academic Journal
A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs
| Τίτλος: | A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs |
|---|---|
| Συγγραφείς: | Philip N. Klein, Sairam Subramanian |
| Συνεισφορές: | The Pennsylvania State University CiteSeerX Archives |
| Πηγή: | ftp://wilma.cs.brown.edu/pub/techreports/93/cs93-35.ps.Z |
| Έτος έκδοσης: | 1993 |
| Συλλογή: | CiteSeerX |
| Περιγραφή: | We give an algorithm requiring polylog time and a linear number of processors to solve singlesource shortest paths in directed planar graphs, bounded-genus graphs, and 2-dimensional overlap graphs. More generally, the algorithm works for any graph provided with a decomposition tree constructed using size-O( p n polylog n) separators. |
| Τύπος εγγράφου: | text |
| Περιγραφή αρχείου: | application/postscript |
| Γλώσσα: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.9280 |
| Διαθεσιμότητα: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.9280 |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Αριθμός Καταχώρησης: | edsbas.215D4704 |
| Βάση Δεδομένων: | BASE |
καταχωρήστε σχόλιο πρώτοι!