Finding and counting given length cycles

Noga Alon, Raphael Yusfer, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

30 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
EditorsJan van Leeuwen
PublisherSpringer Verlag
Number of pages11
ISBN (Print)9783540584346
StatePublished - 1994
Externally publishedYes
Event2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
Duration: Sep 26 1994Sep 28 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume855 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd Annual European Symposium on Algorithms, ESA 1994

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Finding and counting given length cycles'. Together they form a unique fingerprint.

Cite this