325 search results - page 1 / 65 » An efficient parallel algorithm for building the separating ... |
JPDC
2010
13 years 3 days ago
2010
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CR...
ICPPW
1999
IEEE
13 years 9 months ago
1999
IEEE
As group applications become more prevalent, efficient network utilization becomes a major concern. Multicast transmission may use network bandwidth more efficiently than multiple...
SPAA
1993
ACM
13 years 9 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
CP
2010
Springer
13 years 3 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
PODC
1997
ACM
13 years 9 months ago
1997
ACM