@inproceedings{26a412e0a5e24b6aa6d03739182e185f,
title = "Finding and counting given length cycles",
abstract = "We present an assortment of methods for finding aad 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 = "Noga Alon and Raphael Yusfer and Uri Zwick",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1994. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 2nd Annual European Symposium on Algorithms, ESA 1994 ; Conference date: 26-09-1994 Through 28-09-1994",
year = "1994",
doi = "10.1007/bfb0049422",
language = "English (US)",
isbn = "9783540584346",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "354--364",
editor = "{van Leeuwen}, Jan",
booktitle = "Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings",
address = "Germany",
}