9 research outputs found
Packing cycles faster than Erdos-Posa
The Cycle Packing problem asks whether a given undirected graph contains vertex-disjoint cycles. Since the publication of the classic Erdös--Pósa theorem in 1965, this problem received significant attention in the fields of graph theory and algorithm design. In particular, this problem is one of the first problems studied in the framework of parameterized complexity. The nonuniform fixed-parameter tractability of Cycle Packing follows from the Robertson--Seymour theorem, a fact already observed by Fellows and Langston in the 1980s. In 1994, Bodlaender showed that Cycle Packing can be solved in time using exponential space. In the case a solution exists, Bodlaender's algorithm also outputs a solution (in the same time). It has later become common knowledge that Cycle Packing admits a -time (deterministic) algorithm using exponential space, which is a consequence of the Erdös--Pósa theorem. Nowadays, the design of this algorithm is given as an exercise in textbooks on parameterized complexity. Yet, no algorithm that runs in time , beating the bound , has been found. In light of this, it seems natural to ask whetherthe bound is essentially optimal. In this paper, we answer this question negatively by developing a -time (deterministic) algorithm for Cycle Packing. In the case a solution exists, our algorithm also outputs a solution (in the same time). Moreover, apart from beating the bound , our algorithm runs in time linear in , and its space complexity is polynomial in the input size.publishedVersio
A unified half-integral Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups
Erd\H{o}s and P\'{o}sa proved in 1965 that there is a duality between the
maximum size of a packing of cycles and the minimum size of a vertex set
hitting all cycles. Such a duality does not hold if we restrict to odd cycles.
However, in 1999, Reed proved an analogue for odd cycles by relaxing packing to
half-integral packing. We prove a far-reaching generalisation of the theorem of
Reed; if the edges of a graph are labelled by finitely many abelian groups,
then there is a duality between the maximum size of a half-integral packing of
cycles whose values avoid a fixed finite set for each abelian group and the
minimum size of a vertex set hitting all such cycles.
A multitude of natural properties of cycles can be encoded in this setting,
for example cycles of length at least , cycles of length modulo ,
cycles intersecting a prescribed set of vertices at least times, and cycles
contained in given -homology classes in a graph embedded on a
fixed surface. Our main result allows us to prove a duality theorem for cycles
satisfying a fixed set of finitely many such properties.Comment: 28 pages, 4 figure
Non-zero disjoint cycles in highly connected group labelled graphs
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Gamma. A cycle C in G has non-zero weight if for a given orientation of the cycle, when we add the labels of the forward directed edges and subtract the labels of the reverse directed edges, the total is non-zero. We are specifically interested in the maximum number of vertex disjoint non-zero cycles. We prove that if G is a Gamma-labelled graph and (G) over bar is the corresponding undirected graph, then if (G) over bar is 31/2k-connected, either G has k disjoint non-zero cycles or it has a vertex set Q of order at most 2k-2 such that G-Q has no non-zero cycles. The bound "2k-2" is best possible. This generalizes the results due to Thomassen (The Erdos-Posa property for odd cycles in graphs with large connectivity, Combinatorica 21 (2001) 321-333.), Rautenbach and Reed (The Erdos-Posa property for odd cycles in highly connected graphs, Combinatorica 21 (2001) 267-278.) and Kawarabayashi and Reed (Highly parity linked graphs, preprint.), respectively. (C) 2005 Elsevier Inc. All rights reserved