bisection
Category=PBV
charlesedmond
charlesedmond bichot
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
formal description
general
graph
introduction
method
nphardness
objective functions
optimization
partitioning
problem
problems
recursive
Product details
- ISBN 9781848212336
- Weight: 680g
- Dimensions: 158 x 236mm
- Publication Date: 27 Sep 2011
- Publisher: ISTE Ltd and John Wiley & Sons Inc
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
Charles-Edmond Bichot is Associate Professor at École Centrale de Lyon in France. His work always focuses on the graph partitioning optimization problem and its applications.
Patrick Siarry is Professor in automatics and informatics at Paris-Est University in France. His main research interests are the applications of new stochastic global optimization heuristics to various engineering fields.
