NP-complete variants of some classical graph problems
Per Alexandersson · arXiv (Cornell University) · 2020
Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are shown to be NP-complete. Our proofs use straightforward reduction from $3$-SAT.