arXiv · 1401.8096
Shortest node-disjoint paths on random graphs
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Caterina De Bacco, Silvio Franz, David Saad, Chi Ho Yeung. 2014-05-18. Shortest node-disjoint paths on random graphs. https://doi.org/10.1088/1742-5468%2F2014%2F07%2Fp07009
Cite the original work for its findings. Save a collection to share your selection of sources.