Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs

We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of split graphs, both of which are unrelated subclasses of chordal graphs. To complement our result, we show that cutwidth is NP-complete on split graphs, and consequently also on chordal graphs. In addition, we show that cutwidth is trivial on proper interval graphs, another subclass of interval graphs. The cutwidth of interval graphs is open, and only very few graph classes are known so far on which polynomial-time cutwidth algorithms exist. Thus we contribute to define the border between graph classes on which cutwidth is polynomially solvable and on which it remains NP-complete.

[1]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[2]  Petra Mutzel,et al.  A Polyhedral Approach to Planar Augmentation and Related Problems , 1995, ESA.

[3]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[4]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[5]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[6]  Johanne Cohen,et al.  Optimal Linear Arrangement of Interval Graphs , 2006, MFCS.

[7]  Maria J. Serna,et al.  Approximating Layout Problems on Random Geometric Graphs , 2001, J. Algorithms.

[8]  G. Khosrovshahi,et al.  Computing the bandwidth of interval graphs , 1990 .

[9]  David R. Karger,et al.  A randomized fully polynomial time approximation scheme for the all terminal network reliability problem , 1995, STOC '95.

[10]  Guillaume Fertin,et al.  Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints , 2005, WG.

[11]  Maria J. Serna,et al.  Cutwidth I: A linear time fixed parameter algorithm , 2005, J. Algorithms.

[12]  Fillia Makedon,et al.  Minimizing Width in Linear Layouts , 1983, ICALP.

[13]  Mihalis Yannakakis,et al.  A polynomial algorithm for the MIN CUT linear arrangement of trees , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[14]  Maria J. Serna,et al.  Cutwidth II: Algorithms for partial w-trees of bounded degree , 2005, J. Algorithms.

[15]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[17]  Fillia Makedon,et al.  Polynomial time algorithms for the MIN CUT problem on degree restricted trees , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[18]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[19]  Rodrigo A. Botafogo.  Cluster analysis for hypertext systems , 1993, SIGIR.

[20]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

[21]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[22]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[23]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[24]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[25]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[26]  Rastislav Královič,et al.  Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings , 2006, MFCS.

[27]  Fillia Makedon,et al.  Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees , 1982, FOCS.

[28]  N. Mahadev,et al.  Threshold graphs and related topics , 1995 .

[29]  Pinar Heggernes,et al.  Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions , 2007, Theor. Comput. Sci..