-
1
-
-
0037957308
-
Geometric spanners for wireless ad hoc networks
-
K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder. Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Distributed Systems, 14(4):408-421, 2003.
-
(2003)
IEEE Trans. Parallel Distributed Systems
, vol.14
, Issue.4
, pp. 408-421
-
-
Alzoubi, K.1
Li, X.-Y.2
Wang, Y.3
Wan, P.-J.4
Frieder, O.5
-
3
-
-
34547689460
-
A web computing environment for parallel algorithms in java
-
O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide. A web computing environment for parallel algorithms in java. Scalable Computing: Practice and Experience, 7(2):1-14, 2006.
-
(2006)
Scalable Computing: Practice and Experience
, vol.7
, Issue.2
, pp. 1-14
-
-
Bonorden, O.1
Gehweiler, J.2
Meyer Auf Der Heide, F.3
-
4
-
-
37648998882
-
On modularity clustering
-
U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Trans. Knowledge and Data Engineering, 20(2):172-188, 2008.
-
(2008)
IEEE Trans. Knowledge and Data Engineering
, vol.20
, Issue.2
, pp. 172-188
-
-
Brandes, U.1
Delling, D.2
Gaertler, M.3
Görke, R.4
Hoefer, M.5
Nikoloski, Z.6
Wagner, D.7
-
6
-
-
0024748907
-
Dynamic load balancing for distributed memory multiprocessors
-
G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Parallel and Distrib. Comp., 7:279-301, 1989.
-
(1989)
Parallel and Distrib. Comp.
, vol.7
, pp. 279-301
-
-
Cybenko, G.1
-
7
-
-
71049143177
-
Orca reduction and contraction graph clustering
-
D. Delling, R. Görke, C. Schulz, and D. Wagner. Orca reduction and contraction graph clustering. In 5th Int. Conf. on Algorithmic Aspects in Information and Management (AAIM), pages 152-165, 2009.
-
(2009)
5th Int. Conf. on Algorithmic Aspects in Information and Management (AAIM)
, pp. 152-165
-
-
Delling, D.1
Görke, R.2
Schulz, C.3
Wagner, D.4
-
8
-
-
0036529479
-
An efficient algorithm for large-scale detection of protein families
-
A. J. Enright, S. van Dongen, and C. A. Ouzounis. An efficient algorithm for large-scale detection of protein families. Nucleic Acids Research, 30(7):1575-1584, 2002.
-
(2002)
Nucleic Acids Research
, vol.30
, Issue.7
, pp. 1575-1584
-
-
Enright, A.J.1
Van Dongen, S.2
Ouzounis, C.A.3
-
14
-
-
67650997058
-
A new diffusionbased multilevel algorithm for computing graph partitions
-
Best Paper Awards and Panel Summary: 22nd Int. Parallel and Distributed Processing Symposium (IPDPS'08)
-
H. Meyerhenke, B. Monien, and T. Sauerwald. A new diffusionbased multilevel algorithm for computing graph partitions. J. Parallel and Distributed Computing, 69(9):750-761, 2009. Best Paper Awards and Panel Summary: 22nd Int. Parallel and Distributed Processing Symposium (IPDPS'08).
-
(2009)
J. Parallel and Distributed Computing
, vol.69
, Issue.9
, pp. 750-761
-
-
Meyerhenke, H.1
Monien, B.2
Sauerwald, T.3
-
15
-
-
70350569840
-
Graph partitioning and disturbed diffusion
-
H. Meyerhenke, B. Monien, and S. Schamberger. Graph partitioning and disturbed diffusion. Parallel Computing, 35(10-11):544-569, 2009.
-
(2009)
Parallel Computing
, vol.35
, Issue.10-11
, pp. 544-569
-
-
Meyerhenke, H.1
Monien, B.2
Schamberger, S.3
-
16
-
-
37649028224
-
Finding and evaluating community structure in networks
-
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 69(2), 2004.
-
(2004)
Physical Review E (Statistical, Nonlinear, and Soft Matter Physics)
, vol.69
, Issue.2
-
-
Newman, M.E.J.1
Girvan, M.2
-
17
-
-
38049150487
-
A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries
-
volume 4641 of LNCS
-
F. Pellegrini. A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries. In 13th Int. Euro-Par Conference, volume 4641 of LNCS, pages 195-204, 2007.
-
(2007)
13th Int. Euro-Par Conference
, pp. 195-204
-
-
Pellegrini, F.1
-
18
-
-
38849162343
-
Computing communities in large networks using random walks
-
P. Pons and M. Latapy. Computing communities in large networks using random walks. Journal on Graph Algorithms and Applications, 10(2):191-218, 2006.
-
(2006)
Journal on Graph Algorithms and Applications
, vol.10
, Issue.2
, pp. 191-218
-
-
Pons, P.1
Latapy, M.2
-
19
-
-
35248893285
-
Graph clustering
-
August
-
S. E. Schaeffer. Graph clustering. Computer Science Review, 1(1):27-64, August 2007.
-
(2007)
Computer Science Review
, vol.1
, Issue.1
, pp. 27-64
-
-
Schaeffer, S.E.1
-
21
-
-
0025467711
-
A bridging model for parallel computation
-
L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
-
(1990)
Communications of the ACM
, vol.33
, Issue.8
, pp. 103-111
-
-
Valiant, L.G.1
|