Finding and counting given length cycles

Noga Alon; Raphael Yusfer; Uri Zwick

doi:10.1007/bfb0049422

Finding and counting given length cycles

Noga Alon, Raphael Yusfer, Uri Zwick

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

30 Scopus citations

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.

Original language	English
Title of host publication	Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
Editors	Jan van Leeuwen
Publisher	Springer Verlag
Pages	354-364
Number of pages	11
ISBN (Print)	9783540584346
DOIs	https://doi.org/10.1007/bfb0049422
State	Published - 1 Jan 1994
Externally published	Yes
Event	2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands Duration: 26 Sep 1994 → 28 Sep 1994

Publication series

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

Conference

Conference	2nd Annual European Symposium on Algorithms, ESA 1994
Country/Territory	Netherlands
City	Utrecht
Period	26/09/94 → 28/09/94

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/bfb0049422

Cite this

Alon, N., Yusfer, R., & Zwick, U. (1994). Finding and counting given length cycles. In J. van Leeuwen (Ed.), Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings (pp. 354-364). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0049422

@inproceedings{92d0efa065984a7a90287d52a861d0c6,

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.; 2nd Annual European Symposium on Algorithms, ESA 1994 ; Conference date: 26-09-1994 Through 28-09-1994",

year = "1994",

month = jan,

day = "1",

doi = "10.1007/bfb0049422",

language = "English",

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",

}

Alon, N, Yusfer, R & Zwick, U 1994, Finding and counting given length cycles. in J van Leeuwen (ed.), Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 855 LNCS, Springer Verlag, pp. 354-364, 2nd Annual European Symposium on Algorithms, ESA 1994, Utrecht, Netherlands, 26/09/94. https://doi.org/10.1007/bfb0049422

Finding and counting given length cycles. / Alon, Noga; Yusfer, Raphael; Zwick, Uri.
Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. ed. / Jan van Leeuwen. Springer Verlag, 1994. p. 354-364 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Finding and counting given length cycles

AU - Alon, Noga

AU - Yusfer, Raphael

AU - Zwick, Uri

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0011042948

U2 - 10.1007/bfb0049422

DO - 10.1007/bfb0049422

M3 - Conference contribution

AN - SCOPUS:0011042948

SN - 9783540584346

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 354

EP - 364

BT - Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings

A2 - van Leeuwen, Jan

PB - Springer Verlag

T2 - 2nd Annual European Symposium on Algorithms, ESA 1994

Y2 - 26 September 1994 through 28 September 1994

ER -

Finding and counting given length cycles

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this