Algorithmic Graph Theory and Perfect Graphs, Volume 57 (Hardcover, 2nd edition)


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

R1,728
List Price R1,871
Save R143 8%

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles17280
Mobicred@R162pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 12 - 17 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

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

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

North-Holland

Country of origin

United States

Series

Annals of Discrete Mathematics

Release date

February 2004

Availability

Expected to ship within 12 - 17 working days

First published

February 2004

Authors

Dimensions

240 x 165 x 25mm (L x W x T)

Format

Hardcover

Pages

340

Edition

2nd edition

ISBN-13

978-0-444-51530-8

Barcode

9780444515308

Categories

LSN

0-444-51530-5



Trending On Loot