Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Computing A Diameter-Constrained Minimum Spanning Tree, Ayman Mahmoud Abdalla
Computing A Diameter-Constrained Minimum Spanning Tree, Ayman Mahmoud Abdalla
Retrospective Theses and Dissertations
In numerous practical applications, it is necessary to find the smallest possible tree with a bounded diameter. A diameter-constrained minimum spanning tree (DCMST) of a given undirected, edge-weighted graph, G, is the smallest-weight spanning tree of all spanning trees of G which contain no path with more than k edges, where k is a given positive integer. The problem of finding a DCMST is NP-complete for all values of k; 4 ≤ k ≤ (n - 2), except when all edge-weights are identical.
A DCMST is essential for the efficiency of various distributed mutual exclusion algorithms, where …