![cc.complexity theory - Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete? - Theoretical Computer Science Stack Exchange cc.complexity theory - Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete? - Theoretical Computer Science Stack Exchange](https://i.stack.imgur.com/nfLBC.png)
cc.complexity theory - Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete? - Theoretical Computer Science Stack Exchange
![DCA-DS: A Distributed Clustering Algorithm Based on Dominating Set for Internet of Vehicles | SpringerLink DCA-DS: A Distributed Clustering Algorithm Based on Dominating Set for Internet of Vehicles | SpringerLink](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs11277-020-07578-7/MediaObjects/11277_2020_7578_Fig1_HTML.png)
DCA-DS: A Distributed Clustering Algorithm Based on Dominating Set for Internet of Vehicles | SpringerLink
![Solving the k-dominating set problem on very large-scale networks | Computational Social Networks | Full Text Solving the k-dominating set problem on very large-scale networks | Computational Social Networks | Full Text](https://media.springernature.com/lw685/springer-static/image/art%3A10.1186%2Fs40649-020-00078-5/MediaObjects/40649_2020_78_Fig1_HTML.png)