Fixed-Parameter Complexity of Minimum Profile Problems

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.

[1]  林詒勋,et al.  PROFILE MINIMIZATION PROBLEM FOR MATRICES AND GRAPHS , 1994 .

[2]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[3]  Richard M. Karp,et al.  Mapping the genome: some combinatorial problems arising in molecular biology , 1993, STOC.

[4]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[5]  Stefan Szeider,et al.  The Linear Arrangement Problem Parameterized Above Guaranteed Value , 2007, Theory of Computing Systems.

[6]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[7]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[8]  Jacobo Torán,et al.  The MINSUMCUT Problem , 1991, WADS.

[9]  D. Kendall.  Incidence matrices, interval graphs and seriation in archeology. , 1969 .

[10]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

[11]  Alain Billionnet,et al.  On interval graphs and matrice profiles , 1986 .

[12]  Petr A. Golovach,et al.  Graph Searching and Interval Completion , 2000, SIAM J. Discret. Math..

[13]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[14]  Yuan Jinjiang,et al.  Profile minimization problem for matrices and graphs , 1994 .

[15]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[16]  Stefan Szeider,et al.  The Linear Arrangement Problem Parameterized Above Guaranteed Value , 2006, CIAC.

[17]  Peter C. C. Wang.  On incidence matrices , 1970 .

[18]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[19]  Michael R. Fellows,et al.  Parameterized complexity analysis in computational biology , 1995, Comput. Appl. Biosci..

[20]  Maria J. Serna,et al.  Parameterized Complexity for Graph Layout Problems , 2005, Bull. EATCS.

[21]  Haim Kaplan,et al.  Four Strikes Against Physical Mapping of DNA , 1995, J. Comput. Biol..

[22]  Pinar Heggernes,et al.  Interval completion with few edges , 2007, STOC '07.