An instance of the MWEDP problem over a 3-regular random graph of V = 20 and M = 6: examples of solutions of the unconstrained (left) and optimal (right) MWEDP problem are displayed.
收藏Figshare2016-02-23 更新2026-04-29 收录
下载链接：
https://figshare.com/articles/dataset/_An_instance_of_the_MWEDP_problem_over_a_3_regular_random_graph_of_V_20_and_M_6_examples_of_solutions_of_the_unconstrained_left_and_optimal_right_MWEDP_problem_are_displayed_/1631579
下载链接
链接失效反馈官方服务：
资源简介：
In the latter, the purple communication is redirected along a longer path to avoid edge-overlap. The yellow one has two shortest paths of equal length (degeneracy) in the unconstrained case, but once the edge-disjointness is enforced this degeneracy is broken and only one of the two is optimal (right).
创建时间：
2016-02-23
