Algorithmic Graph Theory

Discover the fascinating world of graph theory with Algorithmic Graph Theory by renowned authors from Cambridge University Press. Published in 1985, this comprehensive paperback edition spans 272 pages and serves as an essential resource for both students and professionals alike. This book introduces a wide array of classical concepts in pure and applied graph theory, including spanning trees, connectivity, genus, colourability, flows in networks, and matching and transversals. It delves into many classical theorems while placing a strong emphasis on algorithms and their complexities. Readers will learn which graph problems have efficient solutions and which remain intractable. Whether you're looking to deepen your understanding of graph theory or seeking practical applications, Algorithmic Graph Theory is a must-have addition to your library. Explore the intricacies of algorithms and elevate your knowledge in this dynamic field.