Shortest node-disjoint paths on random graphs
Caterina De Bacco 1 Silvio Franz 1 David Saad 2 Chi Ho Yeung 2, 3, 4 Journal of Statistical Mechanics, 2014, pp.P07009 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 […]
Shortest node-disjoint paths on random graphs Lire la suite »
