Narrow sieves for parameterized paths and packings
نویسندگان
چکیده
منابع مشابه
Narrow sieves for parameterized paths and packings
We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of qsets problem, and the q-dimensional p-matching problem. Our algorithms solve these problems with high probability in time exponential only in the parameter (k, p, q) and using polynomial space; the constant bases of the exponentials are significantly smaller than in previou...
متن کاملAlternating paths revisited IV: packings and 2-packings of A-paths
We construct a combinatorial algorithm to find a maximum packing of fully node-disjoint A-paths. In doing this, we discover relations with fractional packings, 2-packings, and b-packings.
متن کاملA Parameterized Perspective on P2-Packings
We study (vertex-disjoint) P2-packings in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use extremal arguments for determining how many vertices of P appear in some P2-packing of size (j+1). We basically can ’reuse’ 2.5j vertices. We also present a kernelization algorithm that gives a kernel of size bounded by 7k. With these two results we build an ...
متن کاملCounting Paths and Packings in Halves
It is shown that one can count k-edge paths in an n-vertex graph and m-set k-packings on an n-element universe, respectively, in time ` n k/2 ́ and ` n mk/2 ́ , up to a factor polynomial in n, k, and m; in polynomial space, the bounds hold if multiplied by 3 or 5, respectively. These are implications of a more general result: given two set families on an n-element universe, one can count the disj...
متن کاملFinding paths through narrow and wide trees
We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak König’s Lemma, and incomparable in strength to the dual statement (WWKL) that wide binary trees have paths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2017.03.003