Algorithmic Graph Theory and Perfect Graphs

Algorithmic Graph Theory and Perfect Graphs
Author :
Publisher : Elsevier
Total Pages : 341
Release :
ISBN-10 : 9780080526966
ISBN-13 : 0080526969
Rating : 4/5 (969 Downloads)

Book Synopsis Algorithmic Graph Theory and Perfect Graphs by : Martin Charles Golumbic

Download or read book Algorithmic Graph Theory and Perfect Graphs written by Martin Charles Golumbic and published by Elsevier. This book was released on 2004-02-04 with total page 341 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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


Algorithmic Graph Theory and Perfect Graphs Related Books

Algorithmic Graph Theory and Perfect Graphs
Language: en
Pages: 341
Authors: Martin Charles Golumbic
Categories: Mathematics
Type: BOOK - Published: 2004-02-04 - Publisher: Elsevier

GET EBOOK

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to con
Annals of Discrete Mathematics
Language: en
Pages:
Authors: Peter Ladislaw Hammer (Mathématicien)
Categories:
Type: BOOK - Published: 1977 - Publisher:

GET EBOOK

Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity
Language: en
Pages: 411
Authors: J. Nešetril
Categories: Computers
Type: BOOK - Published: 1992-06-26 - Publisher: Elsevier

GET EBOOK

This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference
Graph Theory in Memory of G.A. Dirac
Language: en
Pages: 533
Authors: L. Døvling Andersen
Categories: Mathematics
Type: BOOK - Published: 1988-12-01 - Publisher: Elsevier

GET EBOOK

This volume is a tribute to the life and mathematical work of G.A. Dirac (1925-1984). One of the leading graph theorists, he developed methods of great original
Submodular Functions and Optimization
Language: en
Pages: 395
Authors: Satoru Fujishige
Categories: Computers
Type: BOOK - Published: 2005 - Publisher: Elsevier Science Limited

GET EBOOK

It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication