商品簡介
Graph partitioning began during the early 1970s, and mathematicians evaluate the status of the field after 40 years. Writing for beginners or veterans in applied mathematics or computer science researchers, they describe tools and methods for solving graph partitioning optimization problems. After a general introduction, they cover graph partitioning for numerical analysis, optimization methods for graph partitioning, and other approaches to graph partitioning. The topics include hypergraph partitioning, the static mapping of process graphs, local metaheuristics and graph partitioning, air traffic control graph partitioning applications, applying graph partitioning to image segmentation, and detecting disjoint or overlapping communities in networks. Annotation c2011 Book News, Inc., Portland, OR (booknews.com)
作者簡介
Charles-Edmond Bichot, Institution ecole Centrale de Lyon.
Patrick Siarry, University Paris-Est Creteil (UPEC).
