4926 search results - page 230 / 986 » Two Graph Algorithms On an Associative Computing Model |
153
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...
165
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
158
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
236
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
154
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...