2669:-
Uppskattad leveranstid 5-10 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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.
- Format: Inbunden
- ISBN: 9780521827584
- Språk: Engelska
- Antal sidor: 278
- Utgivningsdatum: 2004-02-01
- Förlag: Cambridge University Press