Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.

Lowell W. Beineke is the Jack W. Schrey Professor Emeritus of Mathematics at Purdue University Fort Wayne. He has written over a hundred papers in graph theory and has served as Editor of The College Mathematics Journal. In addition to four previous volumes in this series, Robin Wilson and he have jointly edited five other books in the field. Recent honours include having an award of the College of Arts and Sciences at his university named after him, being entered into the Purdue University Book of Great Teachers, and receiving a Meritorious Service award from the Mathematical Association of America. He also received a Lifetime Service Award from Who's Who in America. Martin Charles Golumbic is an Emeritus Professor of Computer Science at the University of Haifa and founder of the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science. He is the founding Editor-in-Chief of the journal Annals of Mathematics and Artificial Intelligence. The books he has written include Algorithmic Graph Theory and Perfect Graphs, Tolerance Graphs (with Ann Trenk), Fighting Terror Online: The Convergence of Security, Technology, and the Law and The Zeroth Book of Graph Theory: An Annotated Translation of Les Réseaux (ou Graphes) by André Sainte-Laguë. He is a Foundation Fellow of the Institute of Combinatorics and its Applications, a Fellow of the European Artificial Intelligence society EurAI, and a member of the Academia Europaea, honoris causa. Robin J. Wilson is an Emeritus Professor of Pure Mathematics at the Open University, UK, and of Geometry at Gresham College, London, and is a former Fellow of Keble College, Oxford. He has written and edited over forty books on graph theory, combinatorics and the history of mathematics, including Introduction to Graph Theory and Four Colours Suffice. A former President of the British Society for the History of Mathematics, he has won prizes from the Mathematical Association of America for his expository writing and was awarded the 2017 Stanton Medal of the Institute of Combinatorics and its Applications for his outreach activities in combinatorics.