APA (7th ed.) Citation

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, 259. https://doi.org/10.1109/SFCS.1993.366861

Chicago Style (17th ed.) Citation

Klein, P.N, and S. Subramanian. "A Linear-processor Polylog-time Algorithm for Shortest Paths in Planar Graphs." Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science 1993: 259. https://doi.org/10.1109/SFCS.1993.366861.

MLA (9th ed.) Citation

Klein, P.N, and S. Subramanian. "A Linear-processor Polylog-time Algorithm for Shortest Paths in Planar Graphs." Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 1993, p. 259, https://doi.org/10.1109/SFCS.1993.366861.