-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited
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 …
the study of algorithms and special structural properties. Unit interval graphs, their proper …
A strong integer programming formulation for hybrid flowshop scheduling
We consider a hybrid flowshop scheduling problem that includes parallel unrelated discrete
machines or batch processing machines in different stages of a production system. The …
machines or batch processing machines in different stages of a production system. The …
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
It is known that the maximum cardinality cut problem is NP-hard even in chordal graphs. On
the positive side, the problem is known to be polynomial time solvable in some subclasses …
the positive side, the problem is known to be polynomial time solvable in some subclasses …
A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs
U Joshi, S Rahul, JJ Thoppil - 42nd IARCS Annual Conference …, 2022 - drops.dagstuhl.de
In a geometric intersection graph, given a collection of n geometric objects as input, each
object corresponds to a vertex and there is an edge between two vertices if and only if the …
object corresponds to a vertex and there is an edge between two vertices if and only if the …
Canonical cuts of path powers
The MaxCut problem aims to find a bipartition of vertices in a given graph such that the
number of edges with one end vertex in each part is maximum among all bipartitions. NP …
number of edges with one end vertex in each part is maximum among all bipartitions. NP …
On Tuza's conjecture in co-chain graphs
L Chahua, J Gutiérrez - arXiv preprint arXiv:2211.07766, 2022 - arxiv.org
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every
triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint …
triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint …
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 cardinality cut
problem is polynomial-time solvable for proper interval graphs, both of them turned out to be …
problem is polynomial-time solvable for proper interval graphs, both of them turned out to be …
A Maximum Cardinality Cut Algorithm for Co-bipartite and Split Graphs Using Bimodular Decomposition
The maximum cardinality cut (MaxCut) problem remains NP-complete for co-bipartite graphs
and for split graphs. Based on modular decomposition, in [3] it is shown that MaxCut is …
and for split graphs. Based on modular decomposition, in [3] it is shown that MaxCut is …
Computational and structural apects of interval graphs and their variants
J Novotná - 2019 - dspace.cuni.cz
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 …
the study of algorithms and special structural properties. Unit interval graphs, their proper …
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs
It is known that the maximum cardinality cut problem is NP-hard even in chordal graphs. In
this paper, we consider the time complexity of the problem in proper interval graphs, a …
this paper, we consider the time complexity of the problem in proper interval graphs, a …