2270 search results - page 206 / 454 » On the distribution of eigenvalues of graphs |
199
click to vote
PPOPP
2006
ACM
16 years 14 days ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
206
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
168
click to vote
IPPS
2006
IEEE
16 years 17 days ago
2006
IEEE
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
150
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
159
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...