The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs
classification
💻 cs.DM
keywords
graphsproblemcardinalitychordalintervalmaximumproperalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.