I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study.
Deepak AjwaniAndreas BeckmannUlrich MeyerDavid VeithPublished in: ARCS Workshops (2012)
Keyphrases
- experimental study
- clustering algorithm
- graph theory
- structured data
- random walk
- depth first search
- experimental evaluation
- graph partitioning
- data clustering
- error bounds
- weighted graph
- graph structure
- approximation error
- similarity matrix
- graph representation
- parallel implementation
- synthetic datasets
- bipartite graph
- graph matching
- hierarchical clustering
- closed form
- data points
- graph databases
- spanning tree
- similarity graph
- proximity graph
- real world
- approximation algorithms
- graph model
- data objects
- cluster analysis
- social network analysis
- real life
- nodes of a graph