A Message-Passing Algorithm for Counting Short Cycles in a Graph

Details A Message-Passing Algorithm for Counting Short Cycles in a Graph A Message-Passing Algorithm for Counting Short Cycles in a Graph

2010-04-22

arxiv.org/abs/1004.3966v1

Computer Science

Information Theory

Submitted to IEEE Trans. Inform. Theory, April 21, 2010.

Scientific paper

A message-passing algorithm for counting short cycles in a graph is presented. For bipartite graphs, which are of particular interest in coding, the algorithm is capable of counting cycles of length g, g +2,..., 2g - 2, where g is the girth of the graph. For a general (non-bipartite) graph, cycles of length g; g + 1, ..., 2g - 1 can be counted. The algorithm is based on performing integer additions and subtractions in the nodes of the graph and passing extrinsic messages to adjacent nodes. The complexity of the proposed algorithm grows as $O(g|E|^2)$, where $|E|$ is the number of edges in the graph. For sparse graphs, the proposed algorithm significantly outperforms the existing algorithms in terms of computational complexity and memory requirements.

Affiliated with

Also associated with

No associations

Rating

A Message-Passing Algorithm for Counting Short Cycles in a Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Message-Passing Algorithm for Counting Short Cycles in a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Message-Passing Algorithm for Counting Short Cycles in a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-460042