Topics in Algorithmic Graph Theory (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Encyclopedia of Mathematics and its Applications
Release date:	June 2021
Editors:	Lowell W. Beineke • Martin Charles Golumbic • Robin J. Wilson
Dimensions:	241 x 162 x 25mm (L x W x T)
Format:	Hardcover
Pages:	364
ISBN-13:	978-1-108-49260-7
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Promotions
LSN:	1-108-49260-6
Barcode:	9781108492607

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!