A Measure of the Connection Strengths between Graph Vertices with Applications

Details A Measure of the Connection Strengths between Graph Vertices with Applications A Measure of the Connection Strengths between Graph Vertices with Applications

2009-09-23

arxiv.org/abs/0909.4275v1

Computer Science

Discrete Mathematics

Scientific paper

We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the convergence property, we propose a mutually reinforcing model to explain the intuition behind the strategy. The practical effectiveness of this measure is demonstrated through several combinatorial optimization problems on graphs and hypergraphs.

Affiliated with

Also associated with

No associations

Rating

A Measure of the Connection Strengths between Graph Vertices with Applications 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 Measure of the Connection Strengths between Graph Vertices with Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Measure of the Connection Strengths between Graph Vertices with Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182333