- 1、本文档共8页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《[RA]1995-A_randomized_linear-time_algorithm_to_find_minimum_spanning_trees》.pdf
A Randomized Linear-Time Algorithm
to Find Minimum Spanning Trees
DAVID R. KARGER
Stanford University, Stanford, California
PHILIP N. KLEIN
Brown Unilerslty, Providence, Rhode Island
AND
ROBERT E. TARJAN
Princeton University and NEC Research Institute, Princeton, New Jersey
Abstract. We present a randomized linear-time algorithm to find a minimum spanning tree in a
connected graph with edge weights. The algorithm uses random sampling in combination with a
recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computa-
tional model is a unit-cost random-access machine with the restriction that the only operations
allowed on edge weights are binary comparisons.
Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]:
Nonnumericd Algorithms and Problems—computations orI discrete structures; G.2.2 [Discrete
Mathematics]: Graph Theoq—graph algon”thms, network problems, trees: G.3 [Probability and
Statistics]: probabilistic aZgotithms (including Monte Carlo); 1.5.3 [Pattern Recognition]: Clustering
General Terms: Algorithms
Additional Key Words and Phrases: Matroid, minimum spanning tree, network, randomized
algorithm
D. R. Karger was supported by a Hertz Foundation Graduate Fellowship, by National Science
Foundation (NSF) grant CCR 9010517, and NSF Young Investigator Award CCR 9357849, with
matching grants from IBM, Mitsubishi, the Schlumberger Foundation, the Shell Foundation, and
文档评论(0)