Limit search to available items
Book Cover
E-book
Author DIMACS Implementation Challenge Workshop (10th : 2012 : Atlanta, Ga.)

Title Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors
Published Providence, Rhode Island : American Mathematical Society, [2013]
©2013

Copies

Description 1 online resource (xiii, 240 pages) : illustrations (some color)
Series Contemporary mathematics, 0271-4132 ; 588
Contemporary mathematics (American Mathematical Society) ; v. 588.
Contents High quality graph partitioning / Peter Sanders and Christian Schulz -- http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/'>http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11700 Abusing a hypergraph partitioner for unweighted graph partitioning / B. O. Fagginger Auer and R. H. Bisseling -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11707 Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? / Sivasankaran Rajamanickam and Erik G. Boman -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11711 UMPa: A multi-objective, multi-level partitioner for communication minimization / Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya and Bora Uçar -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11704 Shape optimizing load balancing for MPI-parallel adaptive numerical simulations / Henning Meyerhenke -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11699 Graph partitioning for scalable distributed graph computations / Aydın Buluç and Kamesh Madduri -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11709 Using graph partitioning for efficient network modularity optimization / Hristo Djidjev and Melih Onus -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11713 Modularity maximization in networks by variable neighborhood search / Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron and Manuel Ruiz -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11705 Network clustering via clique relaxations: A community based approach / Anurag Verma and Sergiy Butenko -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11702 Identifying base clusters and their application to maximizing modularity / Sriram Srinivasan, Tanmoy Chakraborty and Sanjukta Bhowmick -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11708 Complete hierarchical cut-clustering: A case study on expansion and modularity / Michael Hamann, Tanja Hartmann and Dorothea Wagner -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11710 A partitioning-based divisive clustering technique for maximizing the modularity / Ümit V. Çatalyürek, Kamer Kaya, Johannes Langguth and Bora Uçar -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11712 An ensemble learning strategy for graph clustering / Michael Ovelgönne and Andreas Geyer-Schulz -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11701 Parallel community detection for massive graphs / E. Jason Riedy, Henning Meyerhenke, David Ediger and David A. Bader -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11703 Graph coarsening and clustering on the GPU / B. O. Fagginger Auer and R. H. Bisseling -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11706
Summary "Graph partitioning and graph clustering are ubiquitous subtasks in many applications where graphs play an important role. Generally speaking, both techniques aim at the identification of vertex subsets with many internal and few external edges. To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: What are the communities within an (online) social network? ; How do I speed up a numerical simulation by mapping it efficiently onto a parallel computer? ; How must components be organized on a computer chip such that they can communicate efficiently with each other? ; What are the segments of a digital image? ; Which functions are certain genes (most likely) responsible for?. The 10th DIMACS Implementation Challenge Workshop was devoted to determining realistic performance of algorithms where worst case analysis is overly pessimistic and probabilistic models are too unrealistic. Articles in the volume describe and analyze various experimental data with the goal of getting insight into realistic algorithm performance in situations where analysis fails. This book is published in cooperation with the Center for Discrete Mathematics and Theoretical Computer Science."--Publisher's website
Bibliography Includes bibliographical references
Notes English
Print version record
Subject Graph algorithms -- Congresses
Graph theory -- Congresses
MATHEMATICS -- General.
Graph algorithms
Graph theory
Combinatorics -- Graph theory -- Graph algorithms.
Computer science -- Algorithms -- Nonnumerical algorithms.
Combinatorics -- Graph theory -- Small world graphs, complex networks.
Computer science -- Algorithms -- Parallel algorithms.
Computer science -- Discrete mathematics in relation to computer science -- Graph theory (including graph drawing)
Combinatorics -- Graph theory -- Graphs and linear algebra (matrices, eigenvalues, etc.)
Combinatorics -- Graph theory -- Hypergraphs.
Genre/Form Conference papers and proceedings
Form Electronic book
Author Bader, David A., 1969- editor.
Meyerhenke, Henning, 1978- editor.
Sanders, Peter, 1967- editor.
Wagner, Dorothea, 1957- editor.
LC no. 2012048265
ISBN 9780821898697
0821898698