Endre Boros, Martin C. Golumbic, Vadim E. Levit, On the number of vertices belonging to all maximum stable sets of a graph, Discrete Applied Mathematics. Algorithmic Graph Theory and Perfect Graphs, 2nd Edition. by Martin Charles Golumbic. Publisher: North Holland. Release Date: February Algorithmic Graph Theory and Perfect Graphs, first published in , has become the classic introduction to the Martin Charles Golumbic.
|Country:||Sao Tome and Principe|
|Published (Last):||5 May 2009|
|PDF File Size:||12.43 Mb|
|ePub File Size:||6.11 Mb|
|Price:||Free* [*Free Regsitration Required]|
He is the editor of the book anx in Artificial Intelligence, Natural Language and Knowledge-based Systems” Springer,the author of the book “Algorithmic Graph Theory and Perfect Graphs” second edition, Elseviercoauthor of a second book “Tolerance Graphs” Cambridge University Press,and the founding editor-in-chief of the journal series “Annals of Mathematics and Artificial Intelligence” Springer.
Professor Golumbic received his Ph. He has given guest lectures in 15 states in the U.
There was a problem providing the content you requested
Account Options Sign in. 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 My library Help Advanced Book Search. Access Braphs via Elsevier Amazon. Algorithmic Graph Theory and Perfect Graphs. ElsevierFeb 4, – Mathematics – pages. Algorithmic Graph Theory and Perfect Graphs, first published inhas become the classic introduction to the field. It remains a stepping stone from which the reader may embark on one of many fascinating research trails.
Algorithmic Graph Theory and Perfect Graphs – Martin Charles Golumbic – Google Books
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 rgaphs second edition.
Selected pages Page Contents Chapter 1 Graph Theoretic Foundations. Chapter 2 The Design of Efficient Algorithms.
Chapter 3 Perfect Graphs. Chapter 4 Triangulated Graphs. Chapter 5 Comparability Graphs. Chapter 6 Split Graphs. Chapter 7 Permutation Graphs.
Chapter 8 Interval Graphs. Chapter 9 Superperfect Graphs. Chapter 10 Threshold Graphs.
Algorithmic Graph Theory and Perfect Graphs, 2nd Edition
Chapter 11 Not So Perfect Graphs. Chapter 12 Perfect Gaussian Elimination. Algorithmic graph theory and perfect graphs Martin Charles Golumbic Snippet view – References to this book Graphical Models Steffen L. Lauritzen Limited preview – Chapter 1 Graph Theoretic Foundations.
Graphical Models Steffen L.