APA (7th ed.) Citation

Gurevich, Y., Stockmeyer, L., & Vishkin, U. (1984). Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. Journal of the ACM, 31, 459. https://doi.org/10.1145/828.322439

Chicago Style (17th ed.) Citation

Gurevich, Yuri, Larry Stockmeyer, and Uzi Vishkin. "Solving NP-hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems." Journal of the ACM 31 (1984): 459. https://doi.org/10.1145/828.322439.

MLA (9th ed.) Citation

Gurevich, Yuri, et al. "Solving NP-hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems." Journal of the ACM, vol. 31, 1984, p. 459, https://doi.org/10.1145/828.322439.