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 Computer science foundations Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on. :259-270 1993 |
| Relation: | Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science |
| Βάση Δεδομένων: | IEEE Xplore Digital Library |
καταχωρήστε σχόλιο πρώτοι!