Sciweavers

1461 search results - page 152 / 293
» Complexity of Graph Covering Problems
Sort
View
OTM
2007
Springer
15 years 4 months ago
Self-healing in Binomial Graph Networks
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...
Thara Angskun, George Bosilca, Jack Dongarra
WG
2007
Springer
15 years 4 months ago
On Finding Graph Clusterings with Maximum Modularity
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...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
IPPS
1999
IEEE
15 years 2 months ago
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
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,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
DATE
1997
IEEE
116views Hardware» more  DATE 1997»
15 years 2 months ago
A new approach to build a low-level malicious fault list starting from high-level description and alternative graphs
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 ...
Alfredo Benso, Paolo Prinetto, Maurizio Rebaudengo...
ICWS
2007
IEEE
14 years 11 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
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...
Umesh Bellur, Roshan Kulkarni