5473 search results - page 637 / 1095 » On the graph isomorphism problem |
171
click to vote
RANDOM
1999
Springer
15 years 11 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
157
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
142
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
185
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
157
click to vote
SSDBM
1990
IEEE
15 years 11 months ago
1990
IEEE
In this paper we explore the structure and semantic properties of the entities stored in statistical databases. We call such entities "statistical objects" (SOS) and prop...