Sciweavers

82 search results - page 1 / 17
» Modularity-Driven Clustering of Dynamic Graphs
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
13 years 8 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 5 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
13 years 10 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner
CCGRID
2008
IEEE
13 years 5 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
CHI
2010
ACM
13 years 10 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon