APA (7th ed.) Citation

Fredman, M., & Willard, D. (1990). Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Foundations of Computer Science, 31st Symposium, 719-725 vol.2. https://doi.org/10.1109/FSCS.1990.89594

Chicago Style (17th ed.) Citation

Fredman, M.L, and D.E Willard. "Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths." Foundations of Computer Science, 31st Symposium 1990: 719-725 vol.2. https://doi.org/10.1109/FSCS.1990.89594.

MLA (9th ed.) Citation

Fredman, M.L, and D.E Willard. "Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths." Foundations of Computer Science, 31st Symposium, 1990, pp. 719-725 vol.2, https://doi.org/10.1109/FSCS.1990.89594.