The Edge-Disjoint Path Problem on Random Graphs by Message-Passing - Fig 5
收藏NIAID Data Ecosystem2026-03-09 收录
数据链接：
官方服务：
资源简介：
Left: Fraction of instances in which convergence standard MP fails (reinforced MP always converged in our experiments). Right: number of iterations for convergence for standard MP and reinforced MP (ρ = 0.002) in case of random graphs of V = 1000 and 〈k〉 = 3 as a function of M/V. Notice how the reinforcement term, besides ensuring convergence, greatly improves the convergence time.
创建时间：
2016-02-23
