Abstract
A linear programming algorithm to compute the broadcast domination number and the multipacking number of a strongly chordal graph is described. It runs in time cubic in the number of vertices of the input graph. A new linear-time algorithm to find the broadcast domination number of a tree is given, as is a simplified linear algorithm to find the multipacking number of a tree.
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.
