Graph Separators, with Applications (Frontiers in Computer Science) - Hardcover

Rosenberg, Arnold L.; Heath, Lenwood S.

Hardcover

ISBN 10: 0306464640 ISBN 13: 9780306464645

Verlag: Springer, 2001

Inhaltsangabe

Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word `separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need.

Über diesen Titel

Über die Autorin bzw. den Autor

Prof. Arnold Rosenberg is a distinguished university professor emeritus at the University of Massachusetts, Amherst. He also held research positions at Northeastern University and Colorado State University, a professorship at Duke University, and a staff research position at IBM Watson Research Center. He was elected a fellow of the ACM in 1996 for his work on graph-theoretic models of compuation, emphasizing theoretical studies of parallel algorithms and architectures, VLSI design and layout, and data structures. In 1997, he was elected as a fellow of the IEEE for fundamental contributions to theoretical aspects of computer science and engineering. Prof. Denis Trystram is a distinguished professor at the Grenoble Institute of Engineering, an honorary member of the Institut Universitaire de France (IUF), and he works at the Laboratoire d'Informatique de Grenoble (LIG) in the team-project DataMove-INRIA. His research interestst include the design and analysis of efficient algorithms for optimizing resource use in parallel and distributed systems, approximation algorithms for scheduling and packing problems, and algorithms for data analytics. Both authors have considerable teaching and practical experience in the application of discrete mathematics approaches to computing tasks.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2001
• Sprache: Englisch
• ISBN 10: 0306464640
• ISBN 13: 9780306464645
• Einband: Gebundene Ausgabe
• Anzahl der Seiten: 269
• Kontakt zum Hersteller: Springer Nature Customer Service Center GmbH; ProductSafety@springernature.com; ; Europaplatz 3; Heidelberg; 69115; Deutschland