Pages that link to "Item:Q3546975"
From MaRDI portal
The following pages link to An algorithm for counting short cycles in bipartite graphs (Q3546975):
Displaying 6 items.
- The cycle's structure of embedded graphs in surfaces (Q277096) (← links)
- Finding a shortest cycle in a subspace of the cycle space of a graph (Q668125) (← links)
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices (Q893659) (← links)
- 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 (Q1003680) (← links)
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles (Q2287757) (← links)
- Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
