Finding and counting given length cycles (1997)
Cached
Download Links
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- [www.cs.tau.ac.il]
- DBLP
Other Repositories/Bibliography
by
Noga Alon
,
Raphael Yuster
,
Uri Zwick
| Venue: | Algorithmica |
| Citations: | 66 - 10 self |
BibTeX
@ARTICLE{Alon97findingand,
author = {Noga Alon and Raphael Yuster and Uri Zwick},
title = {Finding and counting given length cycles},
journal = {Algorithmica},
year = {1997},
volume = {17},
pages = {354--364}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1
