Abstract
A cynical view of graph algorithms is that “everything we want to do is hard.”Indeed, no polynomial-time algorithms are known for any of the problems in this section.All of them are provably NP-complete with the exception of graph isomorphism—whose complexity status remains an open question.
The theory of NP-completeness demonstrates that all NP-complete problems must have polynomial-time algorithms if any one of them does. This prospect is sufficiently preposterous that an NP-completeness reduction suffices as de facto proof that no efficient algorithm exists to solve the given problem.
Still, do not abandon hope if your problem resides in this chapter. We provide a recommended line of attack for each problem, be it combinatorial search, heuristics, approximation algorithms, or algorithms for restricted instances. Hard problems require a different methodology to work with than polynomial-time problems, but with care they can usually be dealt with successfully.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
T. Gonzalez. Handbook of Approximation Algorithms and Metaheuristics. Chapman-Hall / CRC, 2007.
D. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS Publishing, Boston, 1996.
V. Vazirani. Approximation Algorithms. Springer, 2004.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Skiena, S.S. (2012). Graph Problems: Hard Problems. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-84800-070-4_16
Publisher Name: Springer, London
Print ISBN: 978-1-84800-069-8
Online ISBN: 978-1-84800-070-4
eBook Packages: Computer ScienceComputer Science (R0)