Back to Search Start Over

The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs

Authors :
Boyacı, Arman
Ekim, Tinaz
Shalom, Mordechai
Publication Year :
2015

Abstract

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 subclass of chordal graphs, and propose a dynamic programming algorithm which runs in polynomial-time.

Subjects

Subjects :
Computer Science - Discrete Mathematics

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.1512.06893
Document Type :
Working Paper

Tools

Authors Abstract Subjects Details