On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth | IEEE Conference Publication | IEEE Xplore