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.
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
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.
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
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
Ronald Gould is Professor of Mathematics and Computer Science at Emory University. He specializes in combinatorics and graph theory and is most noted for his work in Hamiltonian graph theory.
|
Ask a Question About this Product More... |
|
