Key points are not available for this paper at this time.
This paper presents an O^* (1. 42^n) time algorithm for the Maximum Cut problem on split graphs, along with a subexponential time algorithm for its decision variant.
Marko Lalovic (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: