نتایج جستجو برای: signed k dominating function
تعداد نتایج: 1558751 فیلتر نتایج به سال:
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in recent papers by Kim et al. and Yu et al. to model virtual backbones in wireless networks where the number of hops required to forward messages within the backbone is minimized. We prove that for any fixed k ≥ 1 it is NP-complete to decide whether a given graph admits a dominating set whose induced ...
We show that the problem k-DOMINATING SET and its several variants including k-CONNECTED DOMINATING SET, k-INDEPENDENT DOMINATING SET, and k-DOMINATING CLIQUE, when parameterized by the solution size k, are W[1]-hard in either multiple-interval graphs or their complements or both. On the other hand, we show that these problems belong to W[1] when restricted to multipleinterval graphs and their ...
A class of graphs is said to be biclique-free if there is an integer t such that no graph in the class contains Kt,t as a subgraph. Large families of graph classes, such as any nowhere dense class of graphs or d-degenerate graphs, are biclique-free. We show that various domination problems are fixed-parameter tractable on biclique-free classes of graphs, when parameterizing by both solution siz...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
Motivated by the work of Chung, Claesson, Dukes, and Graham in [5], we define a natural type B analog of the classic bubble sort, and use it to define a type B analog of the maximum drop statistic. We enumerate (by explicit, recursive, and generating function formulas) signed permutations with r type B descents and type B maximum drop at most k. We also find a connection between these signed pe...
Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a kexpression, Dominating Set can be solved in 4knO(1) time. However, no FPT algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a (23k − 1)expression via rank-width and then solving Dominatin...
Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a kexpression, Dominating Set can be solved in 4knO(1) time. However, no FPT algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a (23k − 1)expression via rank-width and then solving Dominatin...
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید