Synopses & Reviews
This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory.
Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. Subsequent chapters explore cycles and circuits, planarity, matchings, and independence. The text concludes with considerations of special topics and applications and extremal theory. Exercises appear throughout the text.
Synopsis
An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. 1988 edition.
Table of Contents
Preface 1. Graphs 2. Paths and Searching 3. Trees 4. Networks 5. Cycles and Circuits 6. Planarity 7. Matchings 8. Independence 9. Special Topics and Applications 10. Extremal Theory Appendix Index