%0 Journal Article %1 Alon1997Finding %A Alon, N. %A Yuster, R. %A Zwick, U. %B Algorithmica %D 1997 %I Springer-Verlag %J Algorithmica %K cycles, graph-theory algorithms %N 3 %P 209--223 %R 10.1007/bf02523189 %T Finding and counting given length cycles %U http://dx.doi.org/10.1007/bf02523189 %V 17 %X 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.

@article{Alon1997Finding, 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.}}, added-at = {2019-06-10T14:53:09.000+0200}, author = {Alon, N. and Yuster, R. and Zwick, U.}, biburl = {https://www.bibsonomy.org/bibtex/2fa01982f4b631a4647f75e350e79ecd7/nonancourt}, booktitle = {Algorithmica}, citeulike-article-id = {2697235}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/bf02523189}, citeulike-linkout-1 = {http://link.springer.com/article/10.1007/BF02523189}, doi = {10.1007/bf02523189}, interhash = {700a2407aa85cfdfacb31261fb458d92}, intrahash = {fa01982f4b631a4647f75e350e79ecd7}, journal = {Algorithmica}, keywords = {cycles, graph-theory algorithms}, month = mar, number = 3, pages = {209--223}, posted-at = {2015-10-14 00:46:42}, priority = {2}, publisher = {Springer-Verlag}, timestamp = {2019-07-31T12:32:46.000+0200}, title = {{Finding and counting given length cycles}}, url = {http://dx.doi.org/10.1007/bf02523189}, volume = 17, year = 1997 }