Results 1  10
of
502
Sort and Search: Exact algorithms for generalized domination ∗
, 2008
"... Let σ and ϱ be two sets of non negative integers. A vertex subset S ⊆ V of an undirected graph G = (V, E) is called a (σ, ϱ)dominating set of G if N(v) ∩ S  ∈ σ for all v ∈ S and N(v) ∩ S  ∈ ϱ for all v ∈ V \ S. This notion introduced by Telle generalizes many dominationtype graph invarian ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
invariants. We present algorithms to check the existence, to find maximum and minimum ({p}, {q})dominating sets and to count the ({p}, {q})dominating sets of a graph in time O ∗ (2 n/2). These results are extended to infinite σ = {p + m · ℓ: ℓ ∈ N0} and ϱ = {q + m · ℓ: ℓ ∈ N0}. Also we show
Branch and Recharge: Exact algorithms for generalized domination
"... Let σ and ϱ be two sets of nonnegative integers. A vertex subset S ⊆ V of an undirected graph G =(V,E) is called a (σ, ϱ)dominating set of G if N(v) ∩ S  ∈σ for all v ∈ S and N(v) ∩ S  ∈ϱ for all v ∈ V \ S. This notion introduced by J. A. Telle generalizes many dominationtype graph invariant ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
sets in an nvertex graph under the above conditions on σ and ϱ. Finally, we also present algorithms using a Sort & Search paradigm to find maximum and minimum ({p}, {q})dominating sets and to count the ({p}, {q})dominating sets of a graph in time O ∗ (2 n/2). 1
Bidimensional parameters and local treewidth
 SIAM Journal on Discrete Mathematics
, 2004
"... Abstract. For several graph theoretic parameters such as vertex cover and dominating set, it is known that if their values are bounded by k then the treewidth of the graph is bounded by some function of k. This fact is used as the main tool for the design of several fixedparameter algorithms on min ..."
Abstract

Cited by 31 (17 self)
 Add to MetaCart
of parameters called minorbidimensional parameters, all minorclosed graph families F excluding some fixed graphs have the parametertreewidth property. The bidimensional parameters include many domination and covering parameters such as vertex cover, feedback vertex set, dominating set, edgedominating set, qdominating
On Perfect Domination of qAry Cubes
"... The construction of perfect dominating sets in all binary 2rcubes (r> 3) with the same number of edges along each coordinate direction is performed, thus generalizing the known construction of this for r = 3. However, an adaptation of that construction aiming to perfect dominating sets in the 14 ..."
Abstract
 Add to MetaCart
The construction of perfect dominating sets in all binary 2rcubes (r> 3) with the same number of edges along each coordinate direction is performed, thus generalizing the known construction of this for r = 3. However, an adaptation of that construction aiming to perfect dominating sets
On the qcriticality of graphs with respect to secure graph domination
"... Abstract A subset X of the vertex set of a graph G is a secure dominating set of G if each vertex of G which is not in X is adjacent to some vertex in X and if, for each vertex u not in X, there is a neighbouring vertex v of u in X such that the swap set (X − {v}) ∪ {u} is again a dominating set of ..."
Abstract
 Add to MetaCart
Abstract A subset X of the vertex set of a graph G is a secure dominating set of G if each vertex of G which is not in X is adjacent to some vertex in X and if, for each vertex u not in X, there is a neighbouring vertex v of u in X such that the swap set (X − {v}) ∪ {u} is again a dominating set
Domination Numbers of QAnalogues of Kneser Graphs
, 1995
"... . We investigate the domination number and total domination number of the graph K q (n; k) whose vertices are all the ksubspaces of an ndimensional vector space over a field with q elements and whose edges are the pairs fU; Wg of vertices such that U " W = f0g. Bounds are obtained in general ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We investigate the domination number and total domination number of the graph K q (n; k) whose vertices are all the ksubspaces of an ndimensional vector space over a field with q elements and whose edges are the pairs fU; Wg of vertices such that U " W = f0g. Bounds are obtained
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
in their clout, investment opportunity sets, access to information, etc. In this study, we ask whether these differences help explain the crosssection of VC investment performance. We focus on the coinvestment networks that VC syndication gives rise to, and leave the other two main networks VCs use (involving
Finding kdominant skylines in high dimensional space
 SIGMOD
"... Given a ddimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a skyline point if there does not exists any point that can dominate it. Skyline queries, which return skyline points, are ..."
Abstract

Cited by 76 (9 self)
 Add to MetaCart
Given a ddimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a skyline point if there does not exists any point that can dominate it. Skyline queries, which return skyline points
The spatial skyline queries
 In VLDB
, 2006
"... In this paper, for the first time, we introduce the concept of Spatial Skyline Queries (SSQ). Given a set of data points P and a set of query points Q, each data point has a number of derived spatial attributes each of which is the point’s distance to a query point. An SSQ retrieves those points of ..."
Abstract

Cited by 75 (7 self)
 Add to MetaCart
In this paper, for the first time, we introduce the concept of Spatial Skyline Queries (SSQ). Given a set of data points P and a set of query points Q, each data point has a number of derived spatial attributes each of which is the point’s distance to a query point. An SSQ retrieves those points
Fuzzy Set Extensions of the DominanceBased Rough Set Approach
"... Abstract Rough set theory has been proposed by Pawlak in the early 80s to deal with inconsistency problems following from information granulation. It operates on an information table composed of a set U of objects described by a set Q of condition and decision attributes. Decision attributes make a ..."
Abstract
 Add to MetaCart
Abstract Rough set theory has been proposed by Pawlak in the early 80s to deal with inconsistency problems following from information granulation. It operates on an information table composed of a set U of objects described by a set Q of condition and decision attributes. Decision attributes make a
Results 1  10
of
502