Random-tree Diameter and the Diameter-constrained MST

DOI10.1080/00207160211289zbMath1008.68086OpenAlexW2140470303MaRDI QIDQ4551459

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

minimum spanning treediameter-constrained MST

Mathematics Subject Classification ID

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

Related Items (2)

Greedy heuristics for the diameter-constrained minimum spanning tree problem ⋮ A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Enumeration of Trees by Height and Diameter

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