Graph Partitioning, Charles-Edmond Bichot and Patrick Siarry (Eds), WILEY & ISTE.
ISBN 978-1-84821-233-6. September 2011. 368 pp. Hardcover. Recommended Retail Price: us$130 / £86.95 / €104.40.
Graph partitioning is a theoretical subject with applications in many areas, principally numerical analysis, program mapping onto parallel architectures, image segmentation, and VLSI design. Over the last 40 years, the literature has strongly increased and big improvements have been made. In this book we bring together knowledge accumulated over all these years to extract both the theoretical foundations of graph partitioning and its main applications.
This book aims at describing the graph partitioning problem by presenting both methodological and applied chapters. There are three parts to the book: the first part presents graph partitioning for numerical applications, the second part presents the optimization view of graph partitioning, and the third part presents other aspects of graph partitioning.
Including new test graphs and test data, this is the first book that really focuses on the graph partitioning optimization problem both theoretically and with its main applications.
Written for: Researchers and graduate students in computer science and fields related to operations research, information technology, applied mathematics and electronics.
Keywords: Operations Research, Heuristic methods, Hard optimization, Image segmentation, VLSI design.
(c) GdR 720 ISIS - CNRS - 2011-2020.