Abstract
AbstractThis paper solves the minimum augmentation problem for a given tree and positive integer k, that is, to make a tree k‐edge‐connected by adding the minimum number of edges. It is shown that the minimum number of edges is the least integer not less than a half of the deficiency of the tree which is defined as the sum of k‐(degree) over all the vertices whose degrees are less than k. The proof is constructive and gives a polynomial‐time algorithm for constructing such an augmentation.
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.
