Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA /

"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 p...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: DIMACS Implementation Challenge Workshop Atlanta, Ga.
Otros Autores: Bader, David A., 1969- (Editor ), Meyerhenke, Henning, 1978- (Editor ), Sanders, Peter, 1967- (Editor ), Wagner, Dorothea, 1957- (Editor )
Formato: Electrónico Congresos, conferencias eBook
Idioma:Inglés
Publicado: Providence, Rhode Island : American Mathematical Society, [2013]
Colección:Contemporary mathematics (American Mathematical Society) ; v. 588.
Temas:
Graph algorithms > Congresses.
Graph theory > Congresses.
Algorithmes de graphes > Congrès.
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.
Conference papers and proceedings
Acceso en línea:Texto completo
Tabla de Contenidos:
  • 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 / Ü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

Ejemplares similares