A new proof of the GHS minimum spanning tree algorithm

被引：0

作者：

Moses, Yoram ^{[1
]}

Shimony, Benny ^{[1
]}

机构：

[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel

来源：

DISTRIBUTED COMPUTING, PROCEEDINGS | 2006年 / 4167卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper provides a proof of correctness for the celebrated Minimum Spanning Tree protocol of Gallager, Humblet and Spira [GHS83]. Both the protocol and the quest for a natural correctness proof have had considerable impact on the literature concerning network protocols and verification. We present an invariance proof that is based on a new intermediate-level abstraction of the protocol. A central role of the intermediate-level configurations in the proof is to facilitate the statement of invariants and other properties of the executions of GHS at the low level. This provides a powerful tool for both the statement and the proof of properties of the algorithm. The result is the first proof that follows the spirit of the informal arguments made in the original paper.

引用

页码：120 / +

页数：2

共 50 条

[31] Algorithm of documents clustering based on Minimum Spanning Tree
Zheng, XS
He, PL
Tian, M
Yuan, FY
[J]. 2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 199 - 203
[32] The design and analysis of algorithm of minimum cost spanning tree
Xu, XS
Liu, DC
Wu, LH
[J]. ACTA MATHEMATICA SCIENTIA, 1996, 16 (03) : 296 - 301
[33] An Algorithm for the Minimum Spanning Tree Problem with Uncertain Structures
Hernandes, F.
Lourenco, M. H. R. S.
[J]. IEEE LATIN AMERICA TRANSACTIONS, 2015, 13 (12) : 3885 - 3889
[34] A memetic algorithm for the biobjective minimum spanning tree problem
Rocha, Daniel A. M.
Gouvea Goldbarg, Elizabeth F.
Goldbarg, Marco Cesar
[J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 222 - 233
[35] A new approach for the multiobjective minimum spanning tree
Santos, J. L.
Pugliese, Luigi Di Puglia
Guerriero, Francesca
[J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 98 : 69 - 83
[36] MINIMUM SPANNING TREE
ROSS, GJS
[J]. THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, 1969, 18 (01): : 103 - &
[37] MINIMUM SPANNING TREE
CAHIT, I
CAHIT, R
[J]. PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON, 1975, 122 (05): : 496 - 496
[38] A new algorithm for degree-constrained minimum spanning tree based on the reduction technique
Ning, Aibing
Ma, Liang
Xiong, Xiaohua
[J]. PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2008, 18 (04) : 495 - 499
[39] A new algorithm for degree-constrained minimum spanning tree based on the reduction technique
Aibing Ning a
[J]. Progress in Natural Science:Materials International, 2008, (04) : 495 - 499
[40] A New Hybrid Genetic Algorithm for Solving the Bounded Diameter Minimum Spanning Tree Problem
Huynh Thi Thanh Binh
Nguyen Xuan, Hoai
McKay, R. I.
[J]. 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 3128 - +

← 1 2 3 4 5 →