The edge-disjoint path problem on random graphs by message-passing

HIGHLIGHTS

• who: Fabrizio Altarelli and collaborators from the , Orsay, FranceEditor: MSohel Rahman, Bangladesh University of have published the research work: The Edge-Disjoint Path Problem on Random Graphs by Message-Passing, in the Journal: PLOS ONE | DOI:10.1371/journal.pone [0145222]. December 28, 2015 of April/22,/2015
• what: In Fig 1 the authors show an example of an instance of this problem on a regular random graph. In Fig 5(left) the authors report the number of converged instances (over 100 realizations) for standard MP (without reinforcement) on four types of random graphs (as . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.