Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
In the Red-Blue Dominating Set problem, we are given a bipartite graph G = (V_B \cup V_R,E) and an integer k, and asked whether G has a subset D \subseteq V_B of at most k "blue" vertices such that each "red" vertex from V_R is adjacent to a vertex in D.
Aug 27, 2014
Jan 30, 2017 · Abstract. In the Red–Blue Dominating Set problem, we are given a bipartite graph G = ( V B ∪ V R , E ) and an integer k , and asked whether G ...
Abstract. In the Red-Blue Dominating Set problem, we are given a bipartite graph G = (VB ∪ VR,E) and an integer k, and asked whether G has a subset D ⊆ VB ...
In the Red-Blue Dominating Set problem, we are given a bipartite graph $G = (V_B \cup V_R,E)$ and an integer $k$, and asked whether $G$ has a subset $D ...
Abstract. In the Red-Blue Dominating Set problem, we are given a bipartite graph G = (VB ∪ VR,E) and an integer k, and asked whether G has a subset D ⊆ VB ...
Apr 28, 2017 · Abstract. In the Red-Blue Dominating Set problem, we are given a bipartite graph. G = (VB ∪VR,E) and an integer k, and asked whether G has ...
People also ask
In the Red-Blue Dominating Set problem, we are given a bipartite graph $G=(VB∪VR,E)$ and an integer $k$, and asked whether G has a subset $D⊆VB$ of at ...
Jul 19, 2013 · In the Red-Blue Dominating Set problem, we are given a bipartite graph. G = (VB ∪ VR,E) and an integer k, and asked whether G has a subset ...
Jan 30, 2017 · In the RED–BLUE DOMINATING SET problem, we are given a bipartite graph G=(VB∪VR,E) and an integer k, and asked whether G has a subset D⊆VB ...
Jul 19, 2013 · In the Red-Blue Dominating Set problem, we are given a bipartite graph. G = (VB ∪ VR,E) and an integer k, and asked whether G has a subset ...