1461 search results - page 152 / 293 » Complexity of Graph Covering Problems |
141
Voted
OTM
2007
Springer
16 years 8 days ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
148
Voted
WG
2007
Springer
16 years 7 days ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
148
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
173
click to vote
DATE
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper a new approach is presented to build a list of faults to be used by the fault injection environment; the list is built starting from a high-level description of the ...
164
click to vote
ICWS
2007
IEEE
15 years 7 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...