Finding and Counting Given Length Cycles

N. Alon, R. Yuster, U. Zwick

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)209-223
Number of pages15
JournalAlgorithmica
Volume17
Issue number3
DOIs
StatePublished - Mar 1997

Keywords

  • Cycles
  • Graph algorithms

Fingerprint

Dive into the research topics of 'Finding and Counting Given Length Cycles'. Together they form a unique fingerprint.

Cite this