Count cycles in bipartite graphs

Version 1.0.0 (28,7 KB) von Shrinivas Chimmalgi
Count cycles less than or equal to specified length in a bipartite graph using message-passing
0.0
(0)
11 Downloads
Aktualisiert 20. Jul 2023

Lizenz anzeigen

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/

Zitieren als

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

Kompatibilität der MATLAB-Version
Erstellt mit R2023a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Quellenangaben

Inspiriert von: Count all cycles in simple undirected graph

Community Treasure Hunt

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

Start Hunting!

Version Veröffentlicht Versionshinweise
1.0.0