An algorithm for counting short cycles in bipartite graphs
From MaRDI portal
Publication:3546975
DOI10.1109/TIT.2005.860472zbMath1316.94108MaRDI QIDQ3546975
Keith M. Chugg, Thomas R. Halford
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Finding shorter cycles in a weighted graph, The cycle's structure of embedded graphs in surfaces, Improved construction of LDPC convolutional codes with semi-random parity-check matrices, On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes]