Figure 1 - Some Complexity Results for the k-Splittable Flow Minimizing Congestion Problem

Network G obtained by 3-partition instance.

Reference

Some Complexity Results for the k-Splittable Flow Minimizing Congestion Problem - Scientific Figure on ResearchGate. Available from: https://www.researchgate.net/figure/Network-G-obtained-by-3-partition-instance_fig1_322186826 [accessed 17 Mar 2025]

Caption

Figure 1. Network G obtained by 3-partition instance.

Embed code

<a href="https://www.researchgate.net/figure/Network-G-obtained-by-3-partition-instance_fig1_322186826"><img src="https://www.researchgate.net/publication/322186826/figure/fig1/AS:631642750214175@1527606775489/Network-G-obtained-by-3-partition-instance.png" alt="Network G obtained by 3-partition instance."/></a>