Exact Algorithms for MaxCut on Split Graphs

This paper presents an $O^{\ast }({1.42}^n)$ time algorithm for the Maximum Cut problem on split graphs, along with a subexponential time algorithm for its decision variant.