The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
Fig 7
We plot (left) the relative performance of MSG over MP in terms of total length of the solution paths: y = 100(Lg/LMP − 1). Here Lg and LMP denote the total path lengths calculated with MSG and MP respectively. We use Reg, RER, ER and SF graphs of fixed size V = 103 and average degree 〈k〉 = 3,5,7 (from top to bottom). On the right we report the number of instances where the two algorithms find the same solution in term of Macc/M over 100 realizations.