Cutwidth of Split Graphs and Threshold 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. 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. The cutwidth of interval graphs is still 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]  G. Khosrovshahi,et al.  Computing the bandwidth of interval graphs , 1990 .

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

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

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

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

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

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

[8]  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.

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

[10]  David R. Karger.  A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem , 1999, SIAM J. Comput..

[11]  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).

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

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

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

[15]  Fanica Gavril,et al.  Some NP-complete problems on graphs , 2011, CISS 2011.

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

[17]  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).

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

[19]  Yuan Jinjiang,et al.  Optimal labelling of unit interval graphs , 1995 .

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

[21]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

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

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

[24]  Fillia Makedon,et al.  On minimizing width in linear layouts , 1989, Discret. Appl. Math..

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

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

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