232 search results - page 3 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
GC
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
ALGORITHMICA
2010
13 years 6 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
CHI
2010
ACM
14 years 1 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
GD
2005
Springer
13 years 12 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
IWANN
2009
Springer
14 years 26 days ago
2009
Springer
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...