Count cycles in bipartite graphs

Versione 1.0.0 (28,7 KB) da Shrinivas Chimmalgi
Count cycles less than or equal to specified length in a bipartite graph using message-passing
0.0
(0)
12 download
Aggiornato 20 lug 2023

Visualizza la licenza

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/

Cita come

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

Compatibilità della release di MATLAB
Creato con R2023a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Riconoscimenti

Ispirato da: 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!

Versione Pubblicato Note della release
1.0.0