| Document Type
|
:
|
BL
|
| Record Number
|
:
|
973696
|
| Doc. No
|
:
|
b728066
|
| Main Entry
|
:
|
Golumbic, Martin Charles.
|
| Title & Author
|
:
|
Algorithmic graph theory and perfect graphs /\ Martin Charles Golumbic.
|
| Publication Statement
|
:
|
Amsterdam ;Boston :: Elsevier,, 2004.
|
| Series Statement
|
:
|
Annals of discrete mathematics ;; 57
|
| Page. NO
|
:
|
1 online resource (xxvi, 314 pages) :: illustrations.
|
| ISBN
|
:
|
0080526969
|
|
|
:
|
: 0444515305
|
|
|
:
|
: 9780080526966
|
|
|
:
|
: 9780444515308
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references and index.
|
| Contents
|
:
|
Graph Theoretic Foundations -- The Design of Efficient Algorithms -- Perfect Graphs -- Triangulated Graphs -- Comparability Graphs -- Split Graphs -- Permutation Graphs -- Interval Graphs -- Superperfect Graphs -- Threshold Graphs -- Not So Perfect Graphs -- Perfect Gaussin Elimination.
|
| Abstract
|
:
|
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.
|
| Subject
|
:
|
Perfect graphs.
|
| Subject
|
:
|
Graphes parfaits.
|
| Subject
|
:
|
Computabilidade e complexidade.
|
| Subject
|
:
|
Perfect graphs.
|
| Subject
|
:
|
Programação inteira e fluxos em rede.
|
| Subject
|
:
|
Programação matemática.
|
| Subject
|
:
|
Teoria dos grafos.
|
| Subject
|
:
|
Grafentheorie.
|
| Dewey Classification
|
:
|
511/.5
|
| LC Classification
|
:
|
QA166.G64 2004eb
|