Relaxation-based coarsening and multiscale graph organization

Details Relaxation-based coarsening and multiscale graph organization Relaxation-based coarsening and multiscale graph organization

2010-04-08

arxiv.org/abs/1004.1220v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the "closeness" between two nodes. The calculation of the measure is linear in the number of edges in the graph and involves just a small number of relaxation sweeps. A similar notion of distance is then calculated and used at each coarser level. We demonstrate the use of this measure in multiscale methods for several important combinatorial optimization problems and discuss the multiscale graph organization.

Affiliated with

Also associated with

No associations

Rating

Relaxation-based coarsening and multiscale graph organization 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 Relaxation-based coarsening and multiscale graph organization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relaxation-based coarsening and multiscale graph organization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-712875