Finding and counting given length cycles

@article{citeulike:2697235, abstract = {Abstract\ \ We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results.}, author = {Alon, N. and Yuster, R. and Zwick, U. }, citeulike-article-id = {2697235}, doi = {http://dx.doi.org/10.1007/BF02523189}, journal = {Algorithmica}, keywords = {clustering\_coefficient, graph\_theory}, month = {March}, number = {3}, pages = {209--223}, posted-at = {2008-04-21 18:07:40}, priority = {2}, title = {Finding and counting given length cycles}, url = {http://dx.doi.org/10.1007/BF02523189}, volume = {17}, year = {1997} }

TY - JOUR ID - citeulike:2697235 L3 - citeulike-article-id:2697235 TI - Finding and counting given length cycles JF - Algorithmica VL - 17 IS - 3 SP - 209 EP - 223 N2 - Abstract  We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results. KW - clustering_coefficient KW - graph_theory AU - Alon, N AU - Yuster, R AU - Zwick, U PY - 1997/03// UR - http://dx.doi.org/10.1007/BF02523189 ER -