An algorithm for counting short cycles in bipartite graphs
From MaRDI portal
Recommendations
- An algorithm for finding longest cycles in certain bipartite graphs
- Counting short cycles of \((c,d)\)-regular bipartite graphs
- scientific article; zbMATH DE number 4063127
- On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph
- AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES
Cited in
(13)- 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
- A counting algorithm for a cyclic binary query
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- Refining invariants for computing autotopism groups of partial Latin rectangles
- The cycle's structure of embedded graphs in surfaces
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- Counting short cycles of \((c,d)\)-regular bipartite graphs
- scientific article; zbMATH DE number 7310089 (Why is no real title available?)
- Finding shorter cycles in a weighted graph
- Number of cycles of small length in a graph
- Finding a shortest cycle in a subspace of the cycle space of a graph
- An efficient algorithm for counting cycles in QC and APM LDPC codes
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
This page was built for publication: An algorithm for counting short cycles in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546975)
