Algorithmic Graph Theory and Perfect Graphs PDF Download

Author: Martin Charles Golumbic
Publisher: Elsevier
ISBN: 1483271978
Category : Mathematics
Languages : en
Pages : 307

View

Book Description
Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect graphs known as comparability graph or transitively orientable graphs. This book discusses as well the two characterizations of triangulated graphs, one algorithmic and the other graph theoretic. The final chapter deals with the method of performing Gaussian elimination on a sparse matrix wherein an arbitrary choice of pivots may result in the filling of some zero positions with nonzeros. This book is a valuable resource for mathematicians and computer scientists.

Author: Martin Charles Golumbic
Publisher: Elsevier
ISBN: 0080526969
Category : Mathematics
Languages : en
Pages : 341

View

Book Description
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

Author: Martin C. Golumbic
Publisher:
ISBN:
Category :
Languages : en
Pages : 284

View

Book Description

Author: Lowell W. Beineke
Publisher: Cambridge University Press
ISBN: 1108671071
Category : Mathematics
Languages : en
Pages : 400

View

Book 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.

Author: Alan Gibbons
Publisher: Cambridge University Press
ISBN: 9780521288811
Category : Computers
Languages : en
Pages : 280

View

Book Description
An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.

Author: Martin Charles Golumbic
Publisher: Springer Nature
ISBN: 3030614204
Category : Mathematics
Languages : en
Pages : 122

View

Book Description
Marking 94 years since its first appearance, this book provides an annotated translation of Sainte-Laguë's seminal monograph Les réseaux (ou graphes), drawing attention to its fundamental principles and ideas. Sainte-Laguë's 1926 monograph appeared only in French, but in the 1990s H. Gropp published a number of English papers describing several aspects of the book. He expressed his hope that an English translation might sometime be available to the mathematics community. In the 10 years following the appearance of Les réseaux (ou graphes), the development of graph theory continued, culminating in the publication of the first full book on the theory of finite and infinite graphs in 1936 by Dénes König. This remained the only well-known text until Claude Berge's 1958 book on the theory and applications of graphs. By 1960, graph theory had emerged as a significant mathematical discipline of its own. This book will be of interest to graph theorists and mathematical historians.

Author: William Kocay
Publisher: CRC Press
ISBN: 135198912X
Category : Mathematics
Languages : en
Pages : 504

View

Book Description
Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction. A comprehensive text, Graphs, Algorithms, and Optimization features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. The book covers major areas of graph theory including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently. The book also provides coverage on algorithm complexity and efficiency, NP-completeness, linear optimization, and linear programming and its relationship to graph algorithms. Written in an accessible and informal style, this work covers nearly all areas of graph theory. Graphs, Algorithms, and Optimization provides a modern discussion of graph theory applicable to mathematics, computer science, and crossover applications.

Author: Bruce A. Reed
Publisher: Springer Science & Business Media
ISBN: 0387224440
Category : Mathematics
Languages : en
Pages : 357

View

Book Description
Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations research

Author: Gary Chartrand
Publisher: McGraw-Hill Companies
ISBN:
Category : Mathematics
Languages : en
Pages : 424

View

Book Description
Designed as a bridge to cross the gap between mathematics and computer science, and planned as the mathematics base for computer science students, this maths text is designed to help the student develop an understanding of the concept of an efficient algorithm.

Author: Andreas Brandstadt
Publisher: SIAM
ISBN: 9780898719796
Category : Mathematics
Languages : en
Pages : 315

View

Book Description
This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers.