All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $9.86Trending at AU $16.82
- AU $11.51Trending at AU $18.80
- AU $64.07Trending at AU $74.86
- AU $28.70Trending at AU $36.95
- AU $44.96Trending at AU $47.10
- AU $24.91Trending at AU $28.23
- AU $9.83Trending at AU $13.31
About this product
- DescriptionThe study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.
- Author(s)Ann N. Trenk,Martin Charles Golumbic
- PublisherCambridge University Press
- Date of Publication12/02/2004
- Series TitleCambridge Studies in Advanced Mathematics
- Series Part/Volume NumberNo.89
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content Note75 b/w illus.
- Weight540 g
- Width152 mm
- Height228 mm
- Spine19 mm
- Series Edited byB. Bollobas,W. Fulton,A. Katok,F. Kirwan,P. Sarnak,B. Simon,B. Totaro
This item doesn't belong on this page.
Thanks, we'll look into this.