Algorithmic Graph Theory
Download Algorithmic Graph Theory PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Algorithmic Graph Theory book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Algorithmic Graph Theory
Author: Alan Gibbons
language: en
Publisher: Cambridge University Press
Release Date: 1985-06-27
An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.
Algorithmic Graph Theory and Perfect Graphs
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. - New edition of the "Classic" book on the topic - Wonderful introduction to a rich research area - Leading author in the field of algorithmic graph theory - Beautifully written for the new mathematician or computer scientist - Comprehensive treatment
Topics in Algorithmic Graph Theory
Author: Lowell W. Beineke
language: en
Publisher: Cambridge University Press
Release Date: 2021-06-03
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.