Skip to content

T. R. Halford and K. M. Chugg, "An algorithm for counting short cycles in bipartite graphs," in IEEE Transactions on Information Theory, vol. 52, no. 1, pp. 287-292, Jan. 2006, doi: 10.1109/TIT.2005.860472.

Notifications You must be signed in to change notification settings

cameronkirk/T.Halford-K.Chugg-2006-Counting-Short-Cycles

Repository files navigation

T.Halford-K.Chugg-2006-Counting-Short-Cycles

Rehost of code from the paper:

T. R. Halford and K. M. Chugg, "An algorithm for counting short cycles in bipartite graphs," in IEEE Transactions on Information Theory, vol. 52, no. 1, pp. 287-292, Jan. 2006, doi: 10.1109/TIT.2005.860472.

References:

Originally made available: http://csi.usc.edu/chugg/tools

LDPC Codes sourced from David MacKay's Encyclopedia of Sparse Graph Codes: http://www.inference.org.uk/mackay/codes/data.html

Installation:

Requires openblas/cblas.

Usage:

Command line, use graph as input without dash: "cyclenumeration.exe PEGREG252x504"

About

T. R. Halford and K. M. Chugg, "An algorithm for counting short cycles in bipartite graphs," in IEEE Transactions on Information Theory, vol. 52, no. 1, pp. 287-292, Jan. 2006, doi: 10.1109/TIT.2005.860472.

Resources

Stars

Watchers

Forks

Packages

No packages published