5438Accesses
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 [52]; an excellent treatment of algorithmic graph theory is found in [53].
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 6291
- Price includes VAT (Japan)
- Softcover Book
- JPY 7864
- Price includes VAT (Japan)
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
Department of Mathematics, Southern Illinois University, Carbondale, IL, 62901-4408, USA
W. D. Wallis
- W. D. Wallis
Search author on:PubMed Google Scholar
Rights and permissions
Copyright information
© 2007 Second Edition, Birkhäuser Boston
About this chapter
Cite this chapter
Wallis, W.D. (2007). Computational Considerations. In: A Beginner’s Guide to Graph Theory. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4580-9_14
Download citation
Publisher Name:Birkhäuser Boston
Print ISBN:978-0-8176-4484-0
Online ISBN:978-0-8176-4580-9
eBook Packages:Mathematics and StatisticsMathematics and Statistics (R0)
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative