232 search results - page 32 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
102
click to vote
PACT
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
IV
2005
IEEE
15 years 5 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
103
click to vote
TVCG
2008
14 years 11 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
105
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
131
click to vote
SIGMOD
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...