• Corpus ID: 210164359

NP-complete variants of some classical graph problems

@article{Alexandersson2020NPcompleteVO,
  title={NP-complete variants of some classical graph problems},
  author={Per Alexandersson},
  journal={ArXiv},
  year={2020},
  volume={abs/2001.04120}
}
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. 

References

SHOWING 1-7 OF 7 REFERENCES
Graph Theory
TLDR
Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a
Cook . The complexity of theorem - proving procedures
  • Graph Theory
  • 2017
2(1):65–72
  • April
  • 1980
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
    Complexity of Computer Computations
  • 1972
pages 85–103
  • Springer US,
  • 1972
STOC ’71
  • pages 151–158, New York, NY, USA,
  • 1971