APA (7th ed.) Citation

Karimi, M., & Banihashemi, A. H. (2013). Message-Passing Algorithms for Counting Short Cycles in a Graph. IEEE transactions on communications, 61(2), 485-495. https://doi.org/10.1109/TCOMM.2012.100912.120503

Chicago Style (17th ed.) Citation

Karimi, M., and A. H. Banihashemi. "Message-Passing Algorithms for Counting Short Cycles in a Graph." IEEE Transactions on Communications 61, no. 2 (2013): 485-495. https://doi.org/10.1109/TCOMM.2012.100912.120503.

MLA (9th ed.) Citation

Karimi, M., and A. H. Banihashemi. "Message-Passing Algorithms for Counting Short Cycles in a Graph." IEEE Transactions on Communications, vol. 61, no. 2, 2013, pp. 485-495, https://doi.org/10.1109/TCOMM.2012.100912.120503.