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

Internet

Texto completo

Items no disponibles

Detalle de Existencias desde

Ejemplares similares