Shortest node-disjoint paths on random graphs

Caterina de Bacco (1) , Silvio Franz (1) , David Saad (2) , Chi Ho Yeung (2, 3, 4)

1 LPTMS - Laboratoire de Physique Théorique et Modèles Statistiques
2 Aston University [Birmingham]
3 Department of Physics [Hong Kong University of Science and Technology]
4 Department of Science and Environmental Studies [Hong Kong]

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.

Domaines: Algorithme et structure de données [cs.DS]; Optimisation et contrôle [math.OC]; Autre [cond-mat.other]

Caterina de Bacco, Silvio Franz, David Saad, Chi Ho Yeung. Shortest node-disjoint paths on random graphs. Journal of Statistical Mechanics: Theory and Experiment, 2014, pp.P07009. ⟨10.1088/1742-5468/2014/07/P07009⟩. ⟨hal-01070758⟩