In this chapter, we see how problems may be classified according to their level of difficulty. Most problems that we consider in this book are of a general character, applying to all members of some family of graphs or digraphs. By an instance of a problem, we mean the problem as applied to one specific member of the family. For example, an instance of the Minimum-Weight Spanning Tree Problem is the problem of finding an optimal tree in a particular weighted connected graph.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Rights and permissions
Copyright information
© 2008 J.A. Bondy & U.S.R. Murty
About this chapter
Cite this chapter
(2008). Complexity of Algorithms. In: Graph Theory. Graduate Texts in Mathematics, vol 244. Springer, London. https://doi.org/10.1007/978-1-84628-970-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-84628-970-5_8
Publisher Name: Springer, London
Print ISBN: 978-1-84628-969-9
Online ISBN: 978-1-84628-970-5