Buch, Englisch, Band 89, 278 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 557 g
Buch, Englisch, Band 89, 278 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 557 g
Reihe: Cambridge Studies in Advanced Mathematics
ISBN: 978-0-521-82758-4
Verlag: Cambridge University Press
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.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
- Mathematik | Informatik EDV | Informatik Angewandte Informatik Computeranwendungen in Wissenschaft & Technologie
- Mathematik | Informatik Mathematik Operations Research Graphentheorie
- Mathematik | Informatik EDV | Informatik Professionelle Anwendung Computer-Aided Design (CAD)
- Technische Wissenschaften Technik Allgemein Computeranwendungen in der Technik
Weitere Infos & Material
1. Introduction; 2. Early work on tolerance graphs; 3. Trees, cotrees and bipartite graphs; 4. Interval probe graphs; 5. Bitolerance graphs and ordered sets; 6. Unit and 50% tolerance graphs; 7. Comparability and invariance results; 8. Bounded bitolerance recognition; 9. Algorithms on tolerance graphs; 10. The hierarchy of bitolerance orders; 11. Tolerance models on trees; 12. Phi-tolerance models; 13. Directed tolerance graphs; 14. Open questions and further directions.
