3008 search results - page 538 / 602 » Independence in connected graphs |
188
click to vote
CPC
2010
15 years 3 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
288
click to vote
DISOPT
2011
15 years 1 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
216
click to vote
FGCS
2011
15 years 1 months ago
2011
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, differen...
156
click to vote
ISCI
2011
15 years 1 months ago
2011
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional...
312
click to vote
PVLDB
2011
15 years 1 months ago
2011
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...