A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs

From MaRDI portal















This page was built for publication: A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509888)