Shortest node-disjoint paths on random graphs
Disordered Systems and Neural Networks
2014-10-17 v2 Data Structures and Algorithms
Optimization and Control
Abstract
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analysed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm.
Cite
@article{arxiv.1401.8096,
title = {Shortest node-disjoint paths on random graphs},
author = {Caterina De Bacco and Silvio Franz and David Saad and Chi Ho Yeung},
journal= {arXiv preprint arXiv:1401.8096},
year = {2014}
}
Comments
22 pages, 14 figures