Klein, P., & Subramanian, S. (1993). A linear-processor polylog-time algorithm for shortest paths in planar graphs. Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on, Computer science foundations, 259. https://doi.org/10.1109/SFCS.1993.366861
Παραπομπή σε μορφή Chicago (17η εκδ.)Klein, P.N, και S. Subramanian. "A Linear-processor Polylog-time Algorithm for Shortest Paths in Planar Graphs." Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on, Computer Science Foundations 1993: 259. https://doi.org/10.1109/SFCS.1993.366861.
Παραπομπή σε μορφή MLA (9th εκδ.)Klein, P.N, και S. Subramanian. "A Linear-processor Polylog-time Algorithm for Shortest Paths in Planar Graphs." Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on, Computer Science Foundations, 1993, p. 259, https://doi.org/10.1109/SFCS.1993.366861.