Abstract
A minimum degree spanning tree of a graph G is a spanning tree of G whose maximum degree is minimum among all spanning trees of G. The minimum degree spanning tree problem (MDST) is to construct such a spanning tree of a graph. In this paper, we propose a polynomial-time algorithm for solving the MDST problem on series-parallel graphs. Our algorithm runs in linear time for series-parallel graphs with small degrees. By applying this algorithm, we also give an approximation algorithm for solving the minimum edge-ranking spanning tree problem on series-parallel graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.