| Topics in Algorithmic Graph Theory Contributor(s): Beineke, Lowell W. (Editor), Golumbic, Martin Charles (Editor), Wilson, Robin J. (Editor) |
|
 |
ISBN: 1108492606 ISBN-13: 9781108492607 Publisher: Cambridge University Press OUR PRICE: $114.95 Product Type: Hardcover - Other Formats Published: August 2021 |
| Additional Information |
| BISAC Categories: - Mathematics | Discrete Mathematics - Mathematics | Graphic Methods |
| Dewey: 511.5 |
| LCCN: 2020053205 |
| Physical Information: 1" H x 7.7" W x 9.4" (1.40 lbs) 364 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |