Graph partitioning and graph clustering : [electronic resource] 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.

By:

(10th : DIMACS Implementation Challenge Workshop (10th : 2012 : Atlanta, Ga.)

Contributor(s):

Material type: Text

TextSeries: Contemporary mathematics ; v. 588Publisher: Providence, Rhode Island : American Mathematical Society, [2013]Description: 1 online resource (xiii, 240 pages : illustrations)Content type:

text

Media type:

unmediated

Carrier type:

volume

ISBN:

9780821898697 (online)

Subject(s):

Additional physical formats: Graph partitioning and graph clustering :DDC classification:

511/.5 23

LOC classification:

QA166.245 .D56 2013

Other classification:

05C85 | 68W05 | 05C82 | 68W10 | 68R10 | 05C50 | 05C65

Online resources:

Contents:

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

Item type:

E-BOOKS

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Home library	Call number	Materials specified	URL	Status	Date due	Barcode
IMSc Library			Link to resource	Available		EBK11870

Includes bibliographical references.

High quality graph partitioning / Peter Sanders and Christian Schulz -- Abusing a hypergraph partitioner for unweighted graph partitioning / B. O. Fagginger Auer and R. H. Bisseling -- Parallel partitioning with Zoltan: Is hypergraph partitioning worth it? / Sivasankaran Rajamanickam and Erik G. Boman -- UMPa: A multi-objective, multi-level partitioner for communication minimization / �Umit V. �Cataly�urek, Mehmet Deveci, Kamer Kaya and Bora U�car -- Shape optimizing load balancing for MPI-parallel adaptive numerical simulations / Henning Meyerhenke -- Graph partitioning for scalable distributed graph computations / Ayd�n Bulu�c and Kamesh Madduri -- Using graph partitioning for efficient network modularity optimization / Hristo Djidjev and Melih Onus -- Modularity maximization in networks by variable neighborhood search / Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron and Manuel Ruiz -- Network clustering via clique relaxations: A community based approach / Anurag Verma and Sergiy Butenko -- Identifying base clusters and their application to maximizing modularity / Sriram Srinivasan, Tanmoy Chakraborty and Sanjukta Bhowmick -- Complete hierarchical cut-clustering: A case study on expansion and modularity / Michael Hamann, Tanja Hartmann and Dorothea Wagner -- A partitioning-based divisive clustering technique for maximizing the modularity / �Umit V. �Cataly�urek, Kamer Kaya, Johannes Langguth and Bora U�car -- An ensemble learning strategy for graph clustering / Michael Ovelg�onne and Andreas Geyer-Schulz -- Parallel community detection for massive graphs / E. Jason Riedy, Henning Meyerhenke, David Ediger and David A. Bader -- Graph coarsening and clustering on the GPU / B. O. Fagginger Auer and R. H. Bisseling --