4926 search results - page 199 / 986 » Two Graph Algorithms On an Associative Computing Model |
150
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,...
152
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
242
Voted
ISCI
2007
15 years 6 months ago
2007
ct 9 Words mean different things to different people, and so are uncertain. We, therefore, need a fuzzy set model for a word 10 that has the potential to capture their uncertaint...
185
click to vote
PVLDB
2010
15 years 4 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
207
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...