Random-tree Diameter and the Diameter-constrained MST

DOI10.1080/00207160211289MaRDI QIDQ4551459zbMATH OpenOpenAlexFDO

Authors Ayman Abdalla, Narsingh Deo

Publication date 27 October 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160211289

zbMATH Keywords

diameter-constrained MSTminimum spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Random-tree diameter and the diameter-constrained MST
• Stochastic bounded diameter minimum spanning tree problem
• A given diameter MST on a random graph
• On the length of a random minimum spanning tree
• Diameter of random spanning trees in a given graph
• On the height of random m‐ary search trees
• Minimum Diameter Spanning Trees and Related Problems
• A randomly weighted minimum spanning tree with a random cost constraint
• A randomly weighted minimum spanning tree with a random cost constraint

Cites work

• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• The Enumeration of Trees by Height and Diameter

Cited in

(9)

• A given diameter MST on a random graph
• scientific article; zbMATH DE number 6678444 (Why is no real title available?)
• Assessing the performance of bi-objective MST for Euclidean and non-Euclidean instances
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• scientific article; zbMATH DE number 1439494 (Why is no real title available?)
• Greedy heuristics for the bounded diameter minimum spanning tree problem
• Revisiting search methods for the bounded-diameter minimum spanning tree problem
• List-based simulated annealing algorithm with novel encoding structure for the bounded diameter minimum spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem

This page was built for publication: Random-tree Diameter and the Diameter-constrained MST

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551459)