CORR
2011
Springer
13 years 4 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
DAM
2011
13 years 7 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
JCO
2007
14 years 10 days ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
DAM
2008
14 years 15 days ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...
ARSCOM
2008
14 years 17 days ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
COCOON
2009
Springer
14 years 7 months ago
2009
Springer
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...