148 search results - page 1 / 30 » DisNet: A Framework for Distributed Graph Computation |
ASUNAM
2011
IEEE
12 years 4 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
PDP
1996
IEEE
13 years 8 months ago
1996
IEEE
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
JPDC
2007
13 years 4 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
JPDC
2008
13 years 4 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...