NPcomplete variants of some classical graph problems
Abstract
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 NPcomplete. Our proofs use straightforward reduction from $3$SAT.
 Publication:

arXiv eprints
 Pub Date:
 January 2020
 arXiv:
 arXiv:2001.04120
 Bibcode:
 2020arXiv200104120A
 Keywords:

 Computer Science  Computational Complexity
 EPrint:
 6 pages