Random-tree Diameter and the Diameter-constrained MST-Reference-Cited by-同舟云学术

Random-tree Diameter and the Diameter-constrained MST

Published:2002-01 Issue:6 Volume:79 Page:651-663
ISSN:0020-7160
Container-title:International Journal of Computer Mathematics
language:en
Short-container-title:International Journal of Computer Mathematics

Author:

Abdalla Ayman,Deo Narsingh

Publisher

Informa UK Limited

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications

Link

http://www.tandfonline.com/doi/pdf/10.1080/00207160211289

Reference13 articles.

1. Ahuja, R. K., Magnanti, T. L. and Orlin, J. B. 1993.“Network Flaws: Theory, Algorithms, and Applications”, 7990Upper Saddle River, NJ: Prentice Hall.

2. Multicasting in a linear lightwave network

3. Compression of correlated bit-vectors

4. Garey, M. R. and Johnson, D. S. 1979.“Computers and Intractability: A Guide to the Theory of NPCompleteness”, 206San Francisco: W. H. Freeman.

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

1. Diameter-Constrained Minimum Spanning Tree Problems: A Survey;2023 International Conference on Information Technology (ICIT);2023-08-09

2. New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem;INFORMS Journal on Computing;2015-02

3. Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems;Lecture Notes in Computer Science;2013

4. A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks;Combinatorica;2012-01

5. Greedy heuristics for the diameter-constrained minimum spanning tree problem;Journal of Mathematical Sciences;2009-09