Abstract

The Bounded Degree Deletion problem (BDD) is that of computing a minimum vertex set in a graph \(G=(V, E)\) with degree bound \(b: V\rightarrow \mathbb {Z}_+\), such that, when it is removed from G, the degree of any remaining vertex v is no larger than b(v). It is a classic problem in graph theory and various results have been obtained including an approximation ratio of \(2+\ln b_{\max }\) [30], where \(b_{\max }\) is the maximum degree bound.

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 call

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.