Descripción
This book delves into the intricate world of tolerance graphs, offering a comprehensive examination of algorithmic graph theory and the structured families of graphs it encompasses. The authors, Martin Charles Golumbic and Ann N. Trenk, illuminate the foundational concepts while exploring the breadth of applications that tolerance graphs have in various fields, such as computer science and operations research. They connect theory with practical implementation, presenting a blend of rigor and accessibility that invites readers to engage deeply with the subject.
Through detailed explanations and illustrative examples, the work highlights both finite and infinite structures within tolerance graphs, emphasizing their unique properties and behaviors. The text serves as both a scholarly resource for researchers seeking advanced insights and a valuable guide for those new to the subject. With a focus on clarity and thoroughness, it paves the way for future explorations in graph theory, fostering an understanding of how these mathematical constructs can solve real-world problems.
Through detailed explanations and illustrative examples, the work highlights both finite and infinite structures within tolerance graphs, emphasizing their unique properties and behaviors. The text serves as both a scholarly resource for researchers seeking advanced insights and a valuable guide for those new to the subject. With a focus on clarity and thoroughness, it paves the way for future explorations in graph theory, fostering an understanding of how these mathematical constructs can solve real-world problems.
Detalles del libro
Formato
Tapa dura
Páginas
278 páginas
Idioma
Inglés
Publicado
mar. 29, 2004
Editorial
Cambridge University Press
Edición
1
Ediciones
3 ediciones
ISBN-10
0521827582
ISBN-13
9780521827584