Count cycles in bipartite graphs

版本 1.0.0 (28.7 KB) 作者: Shrinivas Chimmalgi
Count cycles less than or equal to specified length in a bipartite graph using message-passing
0.0
(0)
6.0 次下载
更新时间 2023/7/20

查看许可证

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/

引用格式

Shrinivas Chimmalgi (2024). Count cycles in bipartite graphs (https://www.mathworks.com/matlabcentral/fileexchange/132548-count-cycles-in-bipartite-graphs), MATLAB Central File Exchange. 检索来源 .

MATLAB 版本兼容性
创建方式 R2023a
兼容任何版本
平台兼容性
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

版本 已发布 发行说明
1.0.0