APA (7th ed.) Citation

Lingas, A., & Lundell, E. (2009). Efficient approximation algorithms for shortest cycles in undirected graphs. Information processing letters, 109(10), 493-498. https://doi.org/10.1016/j.ipl.2009.01.008

Chicago Style (17th ed.) Citation

Lingas, Andrzej, and Eva-Marta Lundell. "Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs." Information Processing Letters 109, no. 10 (2009): 493-498. https://doi.org/10.1016/j.ipl.2009.01.008.

MLA (9th ed.) Citation

Lingas, Andrzej, and Eva-Marta Lundell. "Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs." Information Processing Letters, vol. 109, no. 10, 2009, pp. 493-498, https://doi.org/10.1016/j.ipl.2009.01.008.