4 citations · 17 across the 11 of their papers we have counts for
1 paper · 1 filter
Guyslain Naves
We prove the NP-completeness of the integer multiflow problem in planar graphs, with the following restrictions: there are only two demand edges, both lying on the infinite face of…