NP-complete variants of some classical graph problems
Computational Complexity
2020-01-14 v1
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 NP-complete. Our proofs use straightforward reduction from -SAT.
Cite
@article{arxiv.2001.04120,
title = {NP-complete variants of some classical graph problems},
author = {Per Alexandersson},
journal= {arXiv preprint arXiv:2001.04120},
year = {2020}
}
Comments
6 pages