270 search results - page 12 / 54 » Matching graphs of Hypercubes and Complete Bipartite Graphs |
IPPS
1999
IEEE
14 years 29 days 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,...
ICWS
2007
IEEE
13 years 10 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...
ISAAC
1997
Springer
14 years 25 days ago
1997
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
WG
2009
Springer
14 years 3 months ago
2009
Springer
