Abstract
It is often of interest to analyse a graph in order to discover whether or not it possesses a certain property or to perform an optimization procedure upon the graph. Such an activity is often carried out by the use of an algorithm ? a recipe for the solution of a given mathematical problem. We shall discuss some algorithms for identifying the properties of a given graph, which are useful in both combinatorics and in many application areas of graph theory. We shall also discuss optimization algorithms which are often used to find the subgraph of a given weighted graph which is optimal in some sense. Both of these types of algorithms are of importance in Part II of this book.
Though this be madness, yet there is a method in it.
Hamlet, II,ii — William Shakespeare
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
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Foulds, L.R. (1992). Algorithms. In: Graph Theory Applications. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0933-1_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0933-1_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97599-3
Online ISBN: 978-1-4612-0933-1
eBook Packages: Springer Book Archive