An algorithm for counting short cycles in bipartite graphs

@article{Halford2006AnAF,
  title={An algorithm for counting short cycles in bipartite graphs},
  author={Thomas R. Halford and Keith M. Chugg},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={287-292}
}
Let G=(U/spl cup/W, E) be a bipartite graph with disjoint vertex sets U and W, edge set E, and girth g. This correspondence presents an algorithm for counting the number of cycles of length g, g+2, and g+4 incident upon every vertex in U/spl cup/W. The proposed cycle counting algorithm consists of integer matrix operations and its complexity grows as O(gn/sup 3/) where n=max(|U|,|W|). 
Highly Cited
This paper has 96 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
46 Citations
20 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 46 extracted citations

96 Citations

01020'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 96 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…