Henzinger, M. R., Rao, S., & Gabow, H. N. (2000). Computing Vertex Connectivity: New Bounds from Old Techniques. Journal of algorithms, 34(2), 222-250. https://doi.org/10.1006/jagm.1999.1055
Chicago Style (17th ed.) CitationHenzinger, Monika R., Satish Rao, and Harold N. Gabow. "Computing Vertex Connectivity: New Bounds from Old Techniques." Journal of Algorithms 34, no. 2 (2000): 222-250. https://doi.org/10.1006/jagm.1999.1055.
MLA (9th ed.) CitationHenzinger, Monika R., et al. "Computing Vertex Connectivity: New Bounds from Old Techniques." Journal of Algorithms, vol. 34, no. 2, 2000, pp. 222-250, https://doi.org/10.1006/jagm.1999.1055.
Warning: These citations may not always be 100% accurate.