An algorithm for counting short cycles in bipartite graphs
From MaRDI portal
Publication:3546975
DOI10.1109/TIT.2005.860472zbMath1316.94108MaRDI QIDQ3546975
Thomas R. Halford, Keith M. Chugg
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (11)
The cycle's structure of embedded graphs in surfaces ⋮ Number of cycles of small length in a graph ⋮ Improved construction of LDPC convolutional codes with semi-random parity-check matrices ⋮ Finding a shortest cycle in a subspace of the cycle space of a graph ⋮ Cospectral bipartite graphs with the same degree sequences but with different number of large cycles ⋮ Finding shorter cycles in a weighted graph ⋮ 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] ⋮ Refining invariants for computing autotopism groups of partial Latin rectangles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting short cycles of (c,d)-regular bipartite graphs
This page was built for publication: An algorithm for counting short cycles in bipartite graphs
