Maximum cut on interval graphs of interval count two is NP-complete
From MaRDI portal
Existence problems for PDEs: global existence, local existence, non-existence (35A01) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Finite difference and finite volume methods for ordinary differential equations (65L12) Stability and convergence of numerical methods for ordinary differential equations (65L20) Error bounds for numerical methods for ordinary differential equations (65L70)
Abstract: We show that the Max-Cut problem is NP-complete on interval graphs of interval count two.
This page was built for publication: Maximum cut on interval graphs of interval count two is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393563)
