|
Search
|
MAA Reviews
<< homepage
Algorithmic Graph Theory
Alan Gibbons
Table of Contents
Preface 1. Introducing graphs and algorithmic complexity 2. Spanning-trees, branchings and connectivity 3. Planar graphs 4. Networks and flows 5. Matchings 6. Eulerian and Hamiltonian tours 7. Colouring graphs 8. Graph problems and intractability Appendix Author Index Subject Index.
Back to book details
|