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 partiti...

Celý popis

Uložené v:
Podrobná bibliografia
Hlavní autori: DIMACS Implementation Challenge Workshop, Bader, David A.
Médium: E-kniha Kniha
Jazyk:English
Vydavateľské údaje: Providence, R.I American Mathematical Society 2013
Edícia:Contemporary mathematics
Predmet:
Combinatorics > Graph theory > Graph algorithms. msc
Combinatorics > Graph theory > Graphs and linear algebra (matrices, eigenvalues, etc.). msc
Combinatorics > Graph theory > Hypergraphs. msc
Combinatorics > Graph theory > Small world graphs, complex networks. msc
Computer science > Algorithms > Nonnumerical algorithms. msc
Computer science > Algorithms > Parallel algorithms. msc
Computer science > Discrete mathematics in relation to computer science > Graph theory (including graph drawing). msc
Graph algorithms
Graph algorithms > Congresses
Graph theory
Graph theory > Congresses
ISBN:9780821890387, 0821890387
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 partitioning and graph clustering algorithms are: li>What are the communities within an (online) social network? How do I speed up a numerical simulation by mapping it efficiently onto a parallel computer? How must components be organised on a computer chip such that they can communicate efficiently with each other? What are the segments of a digital image? Which functions are certain genes (most likely) responsible for? The 10th DIMACS Implementation Challenge Workshop was devoted to determining realistic performance of algorithms where worst case analysis is overly pessimistic and probabilistic models are too unrealistic. Articles in the volume describe and analyse various experimental data with the goal of getting insight into realistic algorithm performance in situations where analysis fails. This book is published in cooperation with the Center for Discrete Mathematics and Theoretical Computer Science.
Bibliografia:Includes bibliographical references
Center for Discrete Mathematics and Theoretical Computer Science
ISBN:9780821890387
0821890387