Search Images Maps Play YouTube News Gmail Drive More »
My library | Help | Advanced Book Search | Web History | Sign in

Books

Algorithmic Graph Theory and Perfect Graphs:

Second Edition
Front Cover
1 Review
Elsevier, Feb 4, 2004 - Computers - 340 pages
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
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Related books

Graph theory
Graph theory
Reinhard Diestel
Limited preview - 2000
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Ravindra K. Ahuja,Thomas L. Magnanti,James B. Orlin
Snippet view - 1993
Modern Graph Theory
Modern Graph Theory
Béla Bollobás
Limited preview - 1998
All related books »

Selected pages

Contents

Chapter 1 Graph Theoretic Foundations
1
Chapter 2 The Design of Efficient Algorithms
22
Chapter 3 Perfect Graphs
51
Chapter 4 Triangulated Graphs
81
Chapter 5 Comparability Graphs
105
Chapter 6 Split Graphs
149
Chapter 7 Permutation Graphs
157
Chapter 8 Interval Graphs
171
Chapter 9 Superperfect Graphs
203
Chapter 10 Threshold Graphs
219
Chapter 11 Not So Perfect Graphs
235
Chapter 12 Perfect Gaussian Elimination
254
Appendix
269
Epilogue 2004
277
Index
307
Copyright

Other editions - View all

Algorithmic graph theory and perfect graphs
Algorithmic graph theory and perfect graphs
Martin Charles Golumbic
Snippet view - 1980
Algorithmic Graph Theory and Perfect Graphs
Algorithmic Graph Theory and Perfect Graphs
Martin Charles Golumbic
No preview available - 2004

Common terms and phrases

1’s property acyclic Adj(v adjacency sets algorithm assume bisimplicial called Chapter characterization chordal bipartite graph chordal graphs chordless cycle chords circle graphs circular-arc graphs clique cover clique matrix clique of G cograph color classes columns Combinatorics comparability graph complement complete Corollary corresponding data structure decomposition defined definition denote derived graph Discrete Math endpoint equivalent example exists find finite first Golumbic graph G graph in Figure Graph Theory implication class implies induced subgraph integer intersection graph interval graph isomorphic labeling Lemma Let G linear maximal maximum clique maximum stable set minimal minimum multiplex NP-complete obtain orientation of G partially ordered sets partition path permutation graph polynomial problem Proc Proof Prove the following queue representation satisfies Section semiorder sequence SIAM simplex split graph strong perfect graph subset subtrees superperfect Theorem threshold graph tolerance graphs topological sorting transitive orientation tree triangulated graphs undirected graph Univ vertices

References to this book

From other books

Graphical Models
Graphical Models
Steffen L. Lauritzen
Limited preview - 1996
Bayesian Networks and Decision Graphs
Bayesian Networks and Decision Graphs
FINN VERNER JENSEN,Thomas Dyhre Nielsen
Limited preview - 2007
All Book Search results »

From Google Scholar

Axioms for Probability and Belief-Function Propagation
Prakash P Shenoy, Glenn Shafer
Graphical Models for Associations between Variables, some of which ...
SL Lauritzen, N Wermuth - 1989 - The Annals of Statistics
A partial k-arboretum of graphs with bounded treewidth
Hans L Bodlaender - 1998 - Theoretical Computer Science
The Evolution of the Minimum Degree Ordering Algorithm
Alan George - 1989 - SIAM Review
All Scholar search results »

References from web pages

Algorithmic graph theory and perfect graphs, by Martin C. Golumbic ...
the short period of time since Algorithmic Graph Theory and Perfect Graphs was. published there have been several important advances in this area. ...
doi.wiley.com/ 10.1002/ net.3230130214

Algorithmic graph theory and perfect graphs
Algorithmic Graph Theory and Perfect Graphs,. Academic Press, 1980,. ISBN 0-12-289260-7. This book is a cornerstone in the development towards a theory of ...
www.springerlink.com/ index/ H032410797068413.pdf

Algorithmic Graph Theory and Perfect Graphs, 57 - Elsevier
The publication of this new edition of Algorithmic Graph Theory and Perfect Graphs marks twenty three years since its first appearance. ...
www.elsevier.com/ wps/ find/ bookpreface.cws_home/ 699916/ preface?navopenmenu=4

Martin Charles Golumbic
"Algorithmic Graph Theory and Perfect Graphs". Academic Press, New York, 1980. Second edition, Annals of Discrete Mathematics 57, Elsevier, 2004 ...
www.cri.haifa.ac.il/ people/ martin/ _index.php?pg=publication.php

JSTOR: Algorithmic Graph Theory.
[G 80] M. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980. [J 85] D. JOHNSON, The NP-completeness column: an ongoing ...
links.jstor.org/ sici?sici=0036-1445(198903)31%3A1%3C145%3AAGT%3E2.0.CO%3B2-P

Partial characterizations of clique-perfect graphs I
Golumbic, M., Algorithmic Graph Theory and Perfect Graphs. 1980. Academic Press, New York. [17]. Grötschel, M., Lovász, L. and Schrijver, A., The ellipsoid ...
portal.acm.org/ citation.cfm?id=1350361& jmp=cit& coll=& dl=GUIDE& CFID=15151515& CFTOKEN=6184618

Graph Theory Books
Algorithmic Graph Theory and Perfect Graphs by Golumbic.MC Academic Press, New York, 1980. 05C20 Directed Graphs. Graphs and Digraphs by Chartrand. ...
www1.cs.columbia.edu/ ~sanders/ graphtheory/ writings/ books.html

Perfect Graph -- from Wolfram mathworld
Golumbic, mc Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press, 1980. Skiena, S. "Perfect Graphs." §5.6.4 in Implementing Discrete ...
mathworld.wolfram.com/ PerfectGraph.html

Course on Algorithmic Graph theory 2004
Books:. mc Golumbic, Algorithmic Graph Theory and Perfect graphs, Academic Press, New York, 1980. More:. This is a 6 LP course. Exercises: ...
www.mpi-inf.mpg.de/ ~sunil/ course.html

Algorithmic Graph Theory and Perfect Graphs - Boek - BESLIST.nl
Bekijk en vergelijk informatie, beoordelingen, vragen & antwoorden en de beste winkels voor 'Algorithmic Graph Theory and Perfect Graphs' op BESLIST.nl ...
boeken_engels.beslist.nl/ boeken_engels/ d0000979155/ Algorithmic_Graph_Theory_and_Perfect_Graphs.html

About the author (2004)

Martin Charles Golumbic is Professor of Computer Science and Director of the Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. He is the editor of the book "Advances in Artificial Intelligence, Natural Language and Knowledge-based Systems" (Springer, 1990), the author of the book "Algorithmic Graph Theory and Perfect Graphs" (second edition, Elsevier 2004), coauthor of a second book "Tolerance Graphs" (Cambridge University Press, 2004), and the founding editor-in-chief of the journal series "Annals of Mathematics and Artificial Intelligence" (Springer). Professor Golumbic received his Ph.D. in mathematics from Columbia University in 1975, and has previously held positions at New York University, Bell Laboratories, IBM Israel and Bar-Ilan University as well as visiting positions at UniversitA(c) de Paris, the Weizmann Institute of Science, and Ecole Polytechnique FA(c)dA(c)rale de Lausanne. He has given guest lectures in 15 states in the U.S.A. and in 20 other countries, and he was elected as a Fellow of the European Artificial Intelligence society ECCAI in 2005.

Bibliographic information

QR code for Algorithmic Graph Theory and Perfect Graphs
TitleAlgorithmic Graph Theory and Perfect Graphs: Second Edition
Volume 57 of Annals of Discrete Mathematics
AuthorMartin Charles Golumbic
Edition2
PublisherElsevier, 2004
ISBN0080526969, 9780080526966
Length340 pages
Subjects › 

Computers / Computer Science
Computers / Information Technology
  
Export CitationBiBTeX EndNote RefMan