Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result

Ali Dehghan 0001, Amir H. Banihashemi. Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result. IEEE Transactions on Communications, 68(3):1378-1390, 2020. [doi]

Abstract

Abstract is missing.