Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / [electronic resource]
David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors.
- 1 online resource (xiii, 240 pages : illustrations)
- Contemporary mathematics, v. 588 0271-4132 (print); 1098-3627 (online); .
Includes bibliographical references.
High quality graph partitioning / Abusing a hypergraph partitioner for unweighted graph partitioning / Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? / UMPa: A multi-objective, multi-level partitioner for communication minimization / Shape optimizing load balancing for MPI-parallel adaptive numerical simulations / Graph partitioning for scalable distributed graph computations / Using graph partitioning for efficient network modularity optimization / Modularity maximization in networks by variable neighborhood search / Network clustering via clique relaxations: A community based approach / Identifying base clusters and their application to maximizing modularity / Complete hierarchical cut-clustering: A case study on expansion and modularity / A partitioning-based divisive clustering technique for maximizing the modularity / An ensemble learning strategy for graph clustering / Parallel community detection for massive graphs / Graph coarsening and clustering on the GPU / Peter Sanders and Christian Schulz -- B. O. Fagginger Auer and R. H. Bisseling -- Sivasankaran Rajamanickam and Erik G. Boman -- �Umit V. �Cataly�urek, Mehmet Deveci, Kamer Kaya and Bora U�car -- Henning Meyerhenke -- Ayd�n Bulu�c and Kamesh Madduri -- Hristo Djidjev and Melih Onus -- Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron and Manuel Ruiz -- Anurag Verma and Sergiy Butenko -- Sriram Srinivasan, Tanmoy Chakraborty and Sanjukta Bhowmick -- Michael Hamann, Tanja Hartmann and Dorothea Wagner -- �Umit V. �Cataly�urek, Kamer Kaya, Johannes Langguth and Bora U�car -- Michael Ovelg�onne and Andreas Geyer-Schulz -- E. Jason Riedy, Henning Meyerhenke, David Ediger and David A. Bader -- B. O. Fagginger Auer and R. H. Bisseling -- http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11700 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11707 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11711 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11704 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11699 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11709 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11713 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11705 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11702 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11708 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11710 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11712 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11701 http://www.ams.org/conm/588/ http://dx.doi.org/10.1090/conm/588/11703 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
Mode of access : World Wide Web
9780821898697 (online)
Graph algorithms--Congresses. Graph theory--Congresses. 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.