Abstract
The t-admissibility problem aims to decide whether a graph G has a spanning tree T in which the distance between any two adjacent vertices of G is at most t. Regarding its optimization version, we want to determine the smallest t=σT(G) for which G is t-admissible, i.e., the stretch index of G. The t-admissibility problem is NP-complete for σT(G)≤t, t≥4. We develop strategies and implementations of two exact brute-force algorithms: sequential and parallel, in such a way that we propose parallel strategies for generating all spanning trees of a graph. We also propose two greedy heuristics to obtain solutions for the t-admissibility problem. We evaluate these implementations on random Barabási-Albert graphs, Erdös-Rényi graphs, Watts-Strogatz graphs and Bipartite graphs. Moreover, we determine graph classes for which the heuristics lead us to the stretch index value, such as split graphs, cographs and p-cycle power graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
