13 research outputs found
TREEWIDTH and PATHWIDTH parameterized by vertex cover
After the number of vertices, Vertex Cover is the largest of the classical
graph parameters and has more and more frequently been used as a separate
parameter in parameterized problems, including problems that are not directly
related to the Vertex Cover. Here we consider the TREEWIDTH and PATHWIDTH
problems parameterized by k, the size of a minimum vertex cover of the input
graph. We show that the PATHWIDTH and TREEWIDTH can be computed in O*(3^k)
time. This complements recent polynomial kernel results for TREEWIDTH and
PATHWIDTH parameterized by the Vertex Cover
A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics
International audienceIn this paper, we study the Independent Set (IS) reconfiguration problem in graphs. An IS reconfiguration is a scenario transforming an IS L into another IS R, inserting/removing vertices one step at a time while keeping the cardinalities of intermediate sets greater than a specified threshold. We focus on the bipartite variant where only start and end vertices are allowed in intermediate ISs. Our motivation is an application to the RNA energy barrier problem from bioinformatics, for which a natural parameter would be the difference between the initial IS size and the threshold. We first show the para-NP hardness of the problem with respect to this parameter. We then investigate a new parameter, the cardinality range, denoted by ρ which captures the maximum deviation of the reconfiguration scenario from optimal sets (formally, ρ is the maximum difference between the cardinalities of an intermediate IS and an optimal IS). We give two different routes to show that this problem is in XP for ρ: The first is a direct O(n 2)-space, O(n 2ρ+2.5)-time algorithm based on a separation lemma; The second builds on a parameterized equivalence with the directed pathwidth problem, leading to a O(n ρ+1)-space, O(n ρ+2)-time algorithm for the reconfiguration problem through an adaptation of a prior result by Tamaki [20]. This equivalence is an interesting result in its own right, connecting a reconfiguration problem (which is essentially a connectivity problem within a reconfiguration network) with a structural parameter for an auxiliary graph. We demonstrate the practicality of these algorithms, and the relevance of our introduced parameter, by considering the application of our algorithms on random small-degree instances for our problem. Moreover, we reformulate the computation of the energy barrier between two RNA secondary structures, a classic hard problem in computational biology, as an instance of bipartite reconfiguration. Our results on IS reconfiguration thus yield an XP algorithm in O(n ρ+2) for the energy barrier problem, improving upon a partial O(n 2ρ+2.5) algorithm for the problem
On the pathwidth of almost semicomplete digraphs
We call a digraph {\em -semicomplete} if each vertex of the digraph has at
most non-neighbors, where a non-neighbor of a vertex is a vertex such that there is no edge between and in either direction.
This notion generalizes that of semicomplete digraphs which are
-semicomplete and tournaments which are semicomplete and have no
anti-parallel pairs of edges. Our results in this paper are as follows. (1) We
give an algorithm which, given an -semicomplete digraph on vertices
and a positive integer , in time either
constructs a path-decomposition of of width at most or concludes
correctly that the pathwidth of is larger than . (2) We show that there
is a function such that every -semicomplete digraph of pathwidth
at least has a semicomplete subgraph of pathwidth at least .
One consequence of these results is that the problem of deciding if a fixed
digraph is topologically contained in a given -semicomplete digraph
admits a polynomial-time algorithm for fixed .Comment: 33pages, a shorter version to appear in ESA 201
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth
International audiencePath-decompositions of graphs are an important ingredient of dynamic programming algorithms for solving efficiently many NP-hard problems. Therefore, computing the pathwidth and associated path-decomposition of graphs has both a theoretical and practical interest. In this paper, we design a Branch and Bound algorithm that computes the exact pathwidth of graphs and a corresponding path-decomposition. Our main contribution consists of several non-trivial techniques to reduce the size of the input graph (pre-processing) and to cut the exploration space during the search phase of the algorithm. We evaluate experimentally our algorithm by comparing it to existing algorithms of the literature. It appears from the simulations that our algorithm offers a significant gain with respect to previous work. In particular, it is able to compute the exact pathwidth of any graph with less than 60 nodes in a reasonable running-time (≤ 10 minutes on a standard laptop). Moreover, our algorithm achieves good performance when used as a heuristic (i.e., when returning best result found within bounded time-limit). Our algorithm is not restricted to undirected graphs since it actually computes the directed pathwidth which generalizes the notion of pathwidth to digraphs