A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Minimum Shared Edges Problem on Grid-Like Graphs
[chapter]
2017
Lecture Notes in Computer Science
We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route p paths from a start vertex to a target vertex in a given graph while using at most k edges more than once. We show that MSE can be decided on bounded grids in linear time when both dimensions are either small or large compared to the number p of paths. On the contrary, we show that MSE remains NP-hard on subgraphs of bounded grids. Finally, we study MSE from a parametrised complexity point
doi:10.1007/978-3-319-68705-6_19
fatcat:ia7r2s2zy5gtla342gxsyehqr4