no code implementations • 17 Dec 2020 • Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S. Oliveira, Ana Silva
The computational complexity of the MaxCut problem restricted to interval graphs has been open since the 80's, being one of the problems proposed by Johnson on his Ongoing Guide to NP-completeness, and has been settled as NP-complete only recently by Adhikary, Bose, Mukherjee and Roy.
Computational Complexity Discrete Mathematics 68Q17, 68Q25, 68R10, 05C62 F.2.2
no code implementations • 10 Dec 2020 • Júlio Araújo, Victor Campos, Darlan Girão, João Nogueira, António Salgueiro, Ana Silva
The hull number of $G$ in the cycle convexity, denoted by $hn_{cc}(G)$, is the cardinality of a smallest hull set of $G$.
Combinatorics Discrete Mathematics
