Conference
A linear-processor polylog-time algorithm for shortest paths in planar graphs.
| Τίτλος: | A linear-processor polylog-time algorithm for shortest paths in planar graphs. |
|---|---|
| Συγγραφείς: | Klein, P.N., Subramanian, S. |
| Πηγή: | Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science; 1993, p259-270, 12p |
| Βάση Δεδομένων: | Complementary Index |
καταχωρήστε σχόλιο πρώτοι!