Finding and counting given length cycles | Zendy

Noga Alon | Zendy; Raphael Yuster | Zendy; Uri Zwick | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Finding and counting given length cycles

Author(s) -

Noga Alon,

Raphael Yuster,

Uri Zwick

Publication year - 1994

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/bfb0049422

Subject(s) - undirected graph , computer science , combinatorics , simple (philosophy) , graph , counting problem , upper and lower bounds , discrete mathematics , algorithm , mathematics , theoretical computer science , philosophy , epistemology , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research