Log In Sign Up

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited

by   Jan Kratochvíl, et al.

Interval graphs, intersection graphs of segments on a real line (intervals), play a key role in the study of algorithms and special structural properties. Unit interval graphs, their proper subclass, where each interval has a unit length, has also been extensively studied. We study mixed unit interval graphs; a generalization of unit interval graphs where each interval has still a unit length, but intervals of more than one type (open, closed, semi-closed) are allowed. This small modification captures a much richer class of graphs. In particular, mixed unit interval graphs are not claw-free, compared to unit interval graphs. Heggernes, Meister, and Papadopoulos defined a representation of unit interval graphs called the bubble model which turned out to be useful in algorithm design. We extend this model to the class of mixed unit interval graphs. The original bubble model was used by Boyaci, Ekim, and Shalom for proving the polynomiality of the MaxCut problem on unit interval graphs. However, we found a significant mistake in the proof which seems to be hardly repairable. Moreover, we demonstrate the advantages of such a model by providing a subexponential-time algorithm solving the MaxCut problem on mixed unit interval graphs using our extended version of the bubble model. In addition, it gives us a polynomial-time algorithm for specific mixed unit interval graphs; that improves a state-of-the-art result even for unit interval graphs. We further provide a better algorithmic upper-bound on the clique-width of mixed unit interval graphs. Clique-width is one of the most general structural graph parameters, where a large group of natural problems is still solvable in the tracktable time when an efficient representation is given. Unfortunately, the exact computation of the clique-width representation is NP-hard. Therefore, good upper-bounds on clique-width are highly appreciated.


page 1

page 2

page 3

page 4


On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes

Although it has been claimed in two different papers that the maximum ca...

Automorphism Group of Marked Interval Graphs in FPT

An interval graph is the intersection graph of a set of intervals on the...

Online Coloring of Short Intervals

We study the online graph coloring problem restricted to the intersectio...

Assistance and Interdiction Problems on Interval Graphs

We introduce a novel framework of graph modifications specific to interv...

Twin-width and Transductions of Proper k-Mixed-Thin Graphs

The new graph parameter twin-width, recently introduced by Bonnet, Kim, ...

Rectangular Ruler Wrapping

In 1985 Hopcroft, Joseph and Whitesides introduced the problem of foldin...

Recognizing (Unit) Interval Graphs by Zigzag Graph Searches

Corneil, Olariu, and Stewart [SODA 1998; SIAM Journal on Discrete Mathem...