APA (7th ed.) Citation

Kimelfeld, B., & Kolaitis, P. G. (2014). The Complexity of Mining Maximal Frequent Subgraphs. ACM transactions on database systems, 39(4), 1-33. https://doi.org/10.1145/2629550

Chicago Style (17th ed.) Citation

Kimelfeld, Benny, and Phokion G. Kolaitis. "The Complexity of Mining Maximal Frequent Subgraphs." ACM Transactions on Database Systems 39, no. 4 (2014): 1-33. https://doi.org/10.1145/2629550.

MLA (9th ed.) Citation

Kimelfeld, Benny, and Phokion G. Kolaitis. "The Complexity of Mining Maximal Frequent Subgraphs." ACM Transactions on Database Systems, vol. 39, no. 4, 2014, pp. 1-33, https://doi.org/10.1145/2629550.