3
votes
Complexity of a variation of edge cover for paths
What you are asking for has been studied in the general graph setting under the term "length bounded flows and cuts". See the following paper which shows NP-Completeness and hardness of ...
- 7,039
Only top scored, non community-wiki answers of a minimum length are eligible