UID:
almahu_9948197977102882
Format:
1 online resource (xv, 368 pages) :
,
illustrations, maps
ISBN:
9781118601181
,
1118601181
,
9781118601198
,
111860119X
,
9781118601259
,
1118601254
Content:
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.
Note:
General introduction to graph partitioning / Charles-Edmond Bichot -- A partitioning requiring rapidity and quality : the multilevel method and partitions refinement algorithms / Charles-Edmond Bichot -- Hypergraph partitioning / Cédric Chevalier -- Parallelization of graph partitioning / François Pellegrini -- Static mapping of process graphs / François Pellegrini -- Local metaheuristics and graph partitioning / Charles-Edmond Bichot -- Population-based metaheuristics, fusion-fission and graph partitioning optimization / Charles-Edmond Bichot -- Partitioning mobile networks into tariff zones / Mustapha Oughdi, Sid Lamrous, Alexandre Caminada -- Air traffic control graph partitioning application / Charles-Edmond Bichot, Nicholas Durand -- Application of graph partitioning to image segmentation / AMir Nakib [and others] -- Distances in graph partitioning / Alain Guénoche -- Detection of disjoint or overlapping communities in networks / Jean-Baptiste Angelelli, Alain Guénoche, Laurence Reboul -- Multilevel local optimization of modularity / Thomas Aynaud [and others] -- Appendix : The main tools and test benches for graph partitioning / Charles-Edmond Bichot.
Additional Edition:
Print version: Graph partitioning. London : ISTE ; Hoboken, NJ : Wiley, 2011 ISBN 9781848212336
Language:
English
Keywords:
Electronic books.
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9781118601181
