Abstract
We state that various domination problems are polynomial time solvable in convex bipartite graphs, and we give the main ideas of the algorithms. TOTAL DOMINATING SET is polynomial even for chordal bipartite graphs. Further, it is shown by a reduction from 3SAT that INDEPENDENT DOMINATING SET remains NP-complete when restricted to chordal bipartite graphs.
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.
