Abstract
In this chapter we very briefly discuss the theory of computability and the relationship between graphs and algorithms. In this book we can only introduce the ideas very sketchily. For a more thorough introduction to complexity and NP-completeness, see [45]; an excellent treatment of algorithmic graph theory is found in [46].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wallis, W.D. (2000). Computational Considerations. In: A Beginner’s Guide to Graph Theory. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-3134-7_13
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3134-7_13
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4757-3136-1
Online ISBN: 978-1-4757-3134-7
eBook Packages: Springer Book Archive