Count cycles in bipartite graphs

Count cycles less than or equal to specified length in a bipartite graph using message-passing

버전 1.0.0 (28.7 KB)
다운로드 수: 16
(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 (2026). Count cycles in bipartite graphs (https://kr.mathworks.com/matlabcentral/fileexchange/132548-count-cycles-in-bipartite-graphs), MATLAB Central File Exchange. 검색 날짜: .

도움

도움 받은 파일: Count all cycles in simple undirected graph

일반 정보

MATLAB 릴리스 호환 정보

  • 모든 릴리스와 호환

플랫폼 호환성

  • Windows
  • macOS
  • Linux
새 탭에서 열기
버전 퍼블리시됨 릴리스 정보
1.0.0