Relaxation-based coarsening and multiscale graph organization
Data Structures and Algorithms
2010-04-09 v1 Numerical Analysis
Abstract
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.
Cite
@article{arxiv.1004.1220,
title = {Relaxation-based coarsening and multiscale graph organization},
author = {Dorit Ron and Ilya Safro and Achi Brandt},
journal= {arXiv preprint arXiv:1004.1220},
year = {2010}
}