Count cycles in bipartite graphs
Count cycles less than or equal to specified length in a bipartite graph using message-passing
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Counts cycles of length less than or equal to specified max length in a bipartite graph using message-passing. The bipartite graph should be supplied as an alist file. Code automatically detects if the max cycle length is less than the specified max cycle length.
The code is an implemetation of the Improved Message-Passing Algorithm (IMPA), J. Li, S. Lin and K. Abdel-Ghaffar, "Improved message-passing algorithm for counting short cycles in bipartite graphs," 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, 2015, pp. 416-420, doi: 10.1109/ISIT.2015.7282488.
The example alist files are from D. Mackay. (2002, Apr. 11). D. MacKay’s Gallager code resources [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/
Cite As
Shrinivas Chimmalgi (2026). Count cycles in bipartite graphs (https://in.mathworks.com/matlabcentral/fileexchange/132548-count-cycles-in-bipartite-graphs), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: Count all cycles in simple undirected graph
General Information
- Version 1.0.0 (28.7 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0 |
