3 citations · 6 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
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…
cs.DS2015
The Maximum Cut Problem in Co-bipartite Chain Graphs
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
A \emph{co-bipartite chain} graph is a co-bipartite graph in which the neighborhoods of the vertices in each clique can be linearly ordered with respect to inclusion. It is known t…