Algorithmic Graph Theory and Perfect Graphs

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Computers, General Computing
Cover of the book Algorithmic Graph Theory and Perfect Graphs by Martin Charles Golumbic, Elsevier Science
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Martin Charles Golumbic ISBN: 9780080526966
Publisher: Elsevier Science Publication: February 4, 2004
Imprint: North Holland Language: English
Author: Martin Charles Golumbic
ISBN: 9780080526966
Publisher: Elsevier Science
Publication: February 4, 2004
Imprint: North Holland
Language: English

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
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Elsevier Science

Cover of the book The Science of Cognitive Behavioral Therapy by Martin Charles Golumbic
Cover of the book The Boundary Element Method for Plate Analysis by Martin Charles Golumbic
Cover of the book Mission-Critical Microsoft Exchange 2000 by Martin Charles Golumbic
Cover of the book High Speed Heterostructure Devices by Martin Charles Golumbic
Cover of the book Bank Risk Management in Developing Economies by Martin Charles Golumbic
Cover of the book Advances in Heat Transfer by Martin Charles Golumbic
Cover of the book Advances in Applied Microbiology by Martin Charles Golumbic
Cover of the book Bioscience and Bioengineering of Titanium Materials by Martin Charles Golumbic
Cover of the book Steel Corrosion-Induced Concrete Cracking by Martin Charles Golumbic
Cover of the book Handbook of Game Theory by Martin Charles Golumbic
Cover of the book Shoulder and Elbow Trauma and its Complications by Martin Charles Golumbic
Cover of the book Plant Factory by Martin Charles Golumbic
Cover of the book Advanced Water Injection for Low Permeability Reservoirs by Martin Charles Golumbic
Cover of the book Coal Gasification and Its Applications by Martin Charles Golumbic
Cover of the book Sniffer Pro Network Optimization & Troubleshooting Handbook by Martin Charles Golumbic
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy