Arikati, S. R., Maheshwari, A., & Zaroliagis, C. D. (1997). Efficient computation of implicit representations of sparse graphs. Discrete Applied Mathematics, 78(1), 1-16. https://doi.org/10.1016/S0166-218X(97)00007-3
Chicago Style (17th ed.) CitationArikati, Srinivasa R., Anil Maheshwari, and Christos D. Zaroliagis. "Efficient Computation of Implicit Representations of Sparse Graphs." Discrete Applied Mathematics 78, no. 1 (1997): 1-16. https://doi.org/10.1016/S0166-218X(97)00007-3.
MLA (9th ed.) CitationArikati, Srinivasa R., et al. "Efficient Computation of Implicit Representations of Sparse Graphs." Discrete Applied Mathematics, vol. 78, no. 1, 1997, pp. 1-16, https://doi.org/10.1016/S0166-218X(97)00007-3.
Warning: These citations may not always be 100% accurate.