default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Implementation Challenge Workshop: Graph Partitioning and Graph Clustering 2012
- David A. Bader
, Henning Meyerhenke, Peter Sanders, Dorothea Wagner:
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings. Contemporary Mathematics 588, American Mathematical Society 2013, ISBN 978-0-8218-9038-7 - Peter Sanders, Christian Schulz:
High quality graph partitioning. 1-18 - Bas Fagginger Auer, Rob H. Bisseling:
Abusing a hypergraph partitioner for unweighted graph partitioning. 19-36 - Sivasankaran Rajamanickam, Erik G. Boman:
Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? 37-52 - Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya, Bora Uçar:
UMPa: A multi-objective, multi-level partitioner for communication minimization. 53-66 - Henning Meyerhenke:
Shape optimizing load balancing for MPI-parallel adaptive numerical simulations. 67-82 - Aydin Buluç, Kamesh Madduri:
Graph partitioning for scalable distributed graph computations. 83-102 - Hristo N. Djidjev, Melih Onus:
Using graph partitioning for efficient network modularity optimization. 103-112 - Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz:
Modularity maximization in networks by variable neighborhood search. 113-128 - Anurag Verma, Sergiy Butenko:
Network clustering via clique relaxations: A community based approach. 129-140 - Sriram Srinivasan, Tanmoy Chakraborty, Sanjukta Bhowmick:
Identifying base clusters and their application to maximizing modularity. 141-156 - Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Complete hierarchical cut-clustering: A case study on expansion and modularity. 157-170 - Ümit V. Çatalyürek, Kamer Kaya, Johannes Langguth, Bora Uçar:
A partitioning-based divisive clustering technique for maximizing the modularity. 171-186 - Michael Ovelgönne, Andreas Geyer-Schulz:
An ensemble learning strategy for graph clustering. 187-206 - E. Jason Riedy, Henning Meyerhenke, David Ediger, David A. Bader:
Parallel community detection for massive graphs. 207-222 - Bas Fagginger Auer, Rob H. Bisseling:
Graph coarsening and clustering on the GPU. 223-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-31 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
