TY  - BOOK
AU  - Bader,David A.
AU  - Meyerhenke,Henning
AU  - Sanders,Peter
AU  - Wagner,Dorothea
ED  - DIMACS Implementation Challenge Workshop
TI  - Graph partitioning and graph clustering: 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA 
T2  - Contemporary mathematics, 
SN  - 9780821898697 (online)
AV  - QA166.245 .D56 2013
U1  - 511/.5 23
PY  - 2013///]
CY  - Providence, Rhode Island
PB  - American Mathematical Society
KW  - Graph algorithms
KW  - Congresses
KW  - Graph theory
KW  - Combinatorics -- Graph theory -- Graph algorithms
KW  - msc
KW  - Computer science -- Algorithms -- Nonnumerical algorithms
KW  - Combinatorics -- Graph theory -- Small world graphs, complex networks
KW  - Computer science -- Algorithms -- Parallel algorithms
KW  - Computer science -- Discrete mathematics in relation to computer science -- Graph theory (including graph drawing)
KW  - Combinatorics -- Graph theory -- Graphs and linear algebra (matrices, eigenvalues, etc.)
KW  - Combinatorics -- Graph theory -- Hypergraphs
N1  - Includes bibliographical references; High quality graph partitioning; Peter Sanders and Christian Schulz --; 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; �Umit V. �Cataly�urek, Mehmet Deveci, Kamer Kaya and Bora U�car --; 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�c 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; �Umit V. �Cataly�urek, Kamer Kaya, Johannes Langguth and Bora U�car --; http://www.ams.org/conm/588; http://dx.doi.org/10.1090/conm/588/11712; An ensemble learning strategy for graph clustering; Michael Ovelg�onne 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; Access is restricted to licensed institutions; Electronic reproduction; Providence, Rhode Island; American Mathematical Society; 2013
UR  - http://www.ams.org/conm/588/
UR  - http://dx.doi.org/10.1090/conm/588
ER  -