نتایج جستجو برای: distance dominating set
تعداد نتایج: 875742 فیلتر نتایج به سال:
An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges in the graph such that each edge in E −M is incident with at least one edge in M . In an instance of the parameterized edge dominating set problem we are given a graph G = (V,E) and an integer k and we are asked to decide whether G has an edge dominating set of size at most k. In this paper we show that the parameterized edg...
Full terms and conditions of use:
3 Centralized CDS Construction 335 3.1 Guha and Khuller’s Algorithm . . . . . . . . . . . . . . . . . . . . . 336 3.2 Ruan’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 338 3.3 Cheng’s Greedy Algorithm . . . . . . . . . . . . . . . . . . . . . . . . 340 3.4 Min’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341 3.5 Butenko’s Algorithm . . . . . . ....
If D is a dominating set and the induced subgraph G(D) is connected, then D is a connected dominating set. The minimum size of a connected dominating set in G is called connected domination number γc(G) of G. A graph G is called a perfect connected-dominant graph if γ(H) = γc(H) for each connected induced subgraph H of G. We prove that a graph is a perfect connected-dominant graph if and only i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید