Fixed-Parameter Complexity of Minimum Profile Problems
Algorithmica, vol. 52, no. 2, pp. 133-152, 2008.
A preliminary version of the paper appeared in the proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation, hosted by ALGO 2006, Zürich, Switzerland, September 13-15, 2006. Lecture Notes in Computer Science, vol. 4169, pp. 60-71, 2006.
Download: [paper pdf]
Abstract:The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supergraph. Since computing the profile of a graph is an NP-hard problem, we consider parameterized versions of the problem. Namely, we study the problem of deciding whether the profile of a connected graph of order n is at most n-1+k, considering k as the parameter; this is a parameterization above guaranteed value, since n-1 is a tight lower bound for the profile. We present two fixed-parameter algorithms for this problem. The first algorithm is based on a forbidden subgraph characterization of interval graphs. The second algorithm is based on two simple kernelization rules which allow us to produce a kernel with linear number of vertices and edges. For showing the correctness of the second algorithm we need to establish structural properties of graphs with small profile which are of independent interest.