Abstract
AbstractTwo spanning trees of an undirected graph are totally independent if they are edge disjoint and if the unique paths that connect any pair of vertices in these trees are also node disjoint. Accordingly, \(K \ge 2\) spanning trees are totally independent if they are pairwise totally independent. The problem of finding \(K\) totally independent spanning trees (KTIST) or proving that no such trees do exist is NP-Complete. We investigate KTIST and an optimization problem which consists of finding \(K\) totally independent spanning trees with the minimum possible number of central nodes. Both problems have applications in the design of interconnection networks. We propose an integer programming formulation, valid inequalities and a Branch-and-cut algorithm to solve them. We also present an experimental evaluation of such an algorithm.KeywordsCombinatorial optimizationTotally independent spanning treesPacking connected dominating setsBranch-and-cut algorithms
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.
