Graph partitioning is a theoretical subject with applications in many areas, principally: numerical analysis, programs mapping onto parallel architectures, image segmentation, VLSI design. During the last 40 years, the literature has strongly increased and big improvements have been made.</p><p>This
Graph Partitioning
- Publisher
- Wiley-ISTE
- Year
- 2011
- Tongue
- English
- Leaves
- 369
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Graph partitioning is a theoretical subject with applications in many areas, principally: numerical analysis, programs mapping onto parallel architectures, image segmentation, VLSI design. During the last 40 years, the literature has strongly increased and big improvements have been made.
This book brings together the knowledge accumulated during many years to extract both theoretical foundations of graph partitioning and its main applications.
Content:Chapter 1 General Introduction to Graph Partitioning (pages 1โ25): Charles?Edmond Bichot
Chapter 2 A Partitioning Requiring Rapidity and Quality: The Multilevel Method and Partitions Refinement Algorithms (pages 27โ63): Charles?Edmond Bichot
Chapter 3 Hypergraph Partitioning (pages 65โ80): Cedric Chevalier
Chapter 4 Parallelization of Graph Partitioning (pages 81โ114): Francois Pellegrini
Chapter 5 Static Mapping of Process Graphs (pages 115โ136): Francois Pellegrini
Chapter 6 Local Metaheuristics and Graph Partitioning (pages 137โ161): Charles?Edmond Bichot
Chapter 7 Population?Based Metaheuristics, Fusion?Fission and Graph Partitioning Optimization (pages 163โ199): Charles?Edmond Bichot
Chapter 8 Partitioning Mobile Networks into Tariff Zones (pages 201โ223): Mustapha Oughdi, Sid Lamrous and Alexandre Caminada
Chapter 9 Air Traffic Control Graph Partitioning Application (pages 225โ248): Charles?Edmond Bichot and Nicolas Durand
Chapter 10 Application of Graph Partitioning to Image Segmentation (pages 249โ274): Amir Nakib, Laurent Najman, Hugues Talbot and Patrick Siarry
Chapter 11 Distances in Graph Partitioning (pages 275โ295): Alain Guenoche
Chapter 12 Detection of Disjoint or Overlapping Communities in Networks (pages 297โ314): Jean?Baptiste Angelelli, Alain Guenoche and Laurence Reboul
Chapter 13 Multilevel Local Optimization of Modularity (pages 315โ345): Thomas Aynaud, Vincent D. Blondel, Jean?Loup Guillaume and Renaud Lambiotte
๐ SIMILAR VOLUMES
Combinatorial problems based on graph partitioning enable us to mathematically represent and model many practical applications. Mission planning and the routing problems occurring in logistics perfectly illustrate two such examples. Nevertheless, these problems are not based on the same partitioning
Graph partitioning is a theoretical subject with applications in many areas, principally: numerical analysis, programs mapping onto parallel architectures, image segmentation, VLSI design. During the last 40 years, the literature has strongly increased and big improvements have been made.This book b