MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Randomized Minimum Spanning Tree." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

VARIANCE IN THE RANDOM MINIMUM SPANNING TREE PROBLEM
by Johan Wästlund, Johan W Ästlund
…Evaluation of Janson’s constant for the variance in the random minimum spanning tree problem Johan…
Add To MetaCart

Minimizing Randomness in Minimum Spanning Tree, Parallel Connectivity, and Set Maxima Algorithms
by Seth Pettie, Vijaya Ramachandran — 2001 — In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02
…Minimizing Randomness in Minimum Spanning Tree, Parallel Connectivity, and Set Maxima Algorithms…
Cited by 4 (3 self) – Add To MetaCart

Representing all Minimum Spanning Trees with Applications to Counting and Generation
by David Eppstein — 1995
….376 ), generate a random minimum spanning tree in time O(mn), and list all minimum spanning trees in time O…
Cited by 5 (0 self) – Add To MetaCart

Empirical Observations of Probabilistic Heuristics for the Clustering Problem
by Jeff Bilmes, Amin Vahdat, Windsor Hsu, Eun-Jin Im — 1997
… each one. The randomized algorithms (Max-Cut and minimum spanning tree) were run 2000 times, taking…
Add To MetaCart

A Random Graph Generator
by Monica Van Horn, Angela Richter, Dian Lopez (advisor — 2003
…’s algorithm[1], we grow a minimum spanning tree from one randomly chosen “root” vertex. As mentioned above…
Add To MetaCart

Compressing an Inverted File with LCS
by Fang-yie Leu, Yao-chung Fan
…, into subgraphs by exploiting randomized Minimum Spanning Tree (MST) partition algorithm [3][4]. The well…
Add To MetaCart

Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
by David Fernandez-Baca, David Fern Andez-baca, Giora Slutzki — 1995
…, and Tarjan's O(m) randomized minimum spanning tree algorithm [KKT94], or Fredman and Willard's deterministic…
Cited by 3 (2 self) – Add To MetaCart

A Simpler Minimum Spanning Tree Verification Algorithm
by Valerie King — 1995 — Algorithmica
… between specified pairs of nodes ("query paths") arises in the recent randomized minimum spanning tree…
Cited by 29 (0 self) – Add To MetaCart

Approximate Data Structures with Applications (Extended Abstract)
by Yossi Matias, Jeffrey Scott Vitter, Neal E. Young — 1994
… they can be used in three wellknown algorithms: Prim's algorithm for minimum spanning trees, Dijkstra…
Cited by 14 (8 self) – Add To MetaCart

Approximate Data Structures with Applications
by Exte Nd Ed, Yossi Matias, Jeffrey Scott Vitter, Neal E. Young — 1994 — In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms
… wellknown algorithms: Prim's algorithm for minimum spanning trees, Dijkstra's shortest paths algorithm…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB