1395 search results - page 87 / 279 » (k, )-Distance-Hereditary Graphs |
DAM
2000
14 years 9 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
KDD
2010
ACM
14 years 8 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
100
click to vote
CPC
2006
14 years 10 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
IPL
2010
14 years 4 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...