Inbunden, Engelska, 2004
Del 89 i serien Cambridge Studies in Advanced Mathematics
Tolerance Graphs
Av Martin Charles Golumbic, Ann N. Trenk
2359 kr
Skickas torsdag 12/11. Fri frakt för medlemmar vid köp för minst 249 kr.
Beskrivning
The 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.
Produktinformation
- Utgivningsdatum: 2004-02-12
- Mått: 158 x 236 x 19 mm
- Vikt: 540 g
- Format: Inbunden
- Språk: Engelska
- Serie: Cambridge Studies in Advanced Mathematics
- Antal sidor: 278
- Förlag: Cambridge University Press
- ISBN: 9780521827584
Utforska kategorier
Recensioner i media
' … great value to researchers in the field, and it can also be used as a graduate text in graph theory, since many examples and exercises have been included.' Zentralblatt MATH
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.