A simple algorithm for computing minimum spanning trees in the internet-Reference-Cited by-同舟云学术

A simple algorithm for computing minimum spanning trees in the internet

Published:1997-09 Issue:1-2 Volume:101 Page:47-69
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Abdel-Wahab H.,Stoica I.,Sultan F.,Wilson K.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference17 articles.

1. Shared workspaces for group collaboration: An experiment using Internet and UNIX interprocess communications;Abdel-Wahab;IEEE Commun. Mag.,1988

2. The design and implementation of an Internet conference information system;Abdel-Wahab,1994

3. Optimal distributed algorithms for minimum spanning trees;Awerbuch,1987

4. T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT)—An architecture for scalable inter-domain multicast routing, in: SIGCOMM'93 Proc., pp. 85–94.

5. Graph Theory, An Introductory Course;Bollobas,1979

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimum Spanning Trees Across Well-Connected Cities and with Location-Dependent Weights;Communications in Mathematics and Statistics;2021-07-08

2. A fast minimum spanning tree algorithm based on K-means;Information Sciences;2015-02

3. Time-Varying Network Optimization;International Series in Operations Research & Management Science;2007

4. Minimum spanning trees of weighted scale-free networks;Europhysics Letters (EPL);2005-10

5. Decomposable Algorithms for Computing Minimum Spanning Tree;Distributed Computing - IWDC 2003;2003