Dibrova M.A., Kogan A.V., Kutsenko V.A.

In the article questions increasing the efficiency of traffic engineering based on multipath routing using partially overlapping paths. The problem of finding the maximum number of partially overlapping paths is reduced to the problem of finding the minimum of the junction area of the graph with the subsequent formation of a plurality of disjoint paths to the nodes of the junction area.

Full text (pdf)