An exact algorithm for connected red–blue dominating set
In the Connected Red–Blue Dominating Set problem we are given a graph G whose vertex set is partitioned into two parts R and B (red and blue vertices), and we are asked to find a connected subgraph induced by a subset S of B such that each red vertex of G is adjacent to some vertex in S . The proble...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2011
|
| Online Access: | http://hdl.handle.net/10725/2776 http://dx.doi.org/10.1016/j.jda.2011.03.006 http://www.sciencedirect.com/science/article/pii/S1570866711000360 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!