Abstract
The minimum dominating set (MDS) problem is known to be NP-hard. Compared with the currently fastest extract algorithm for MDS problem on graphs of n vertices using O(20.59n)time, which could merely tackle these problems with 200 vertices scale in 8 hours, the paper presents a faster approximate layer-method to address MDS problems in O(n2) time and the method is proved to be effective particularly for larger scale MDS. Furthermore, the programing phases are shown in detail.
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.
