This paper presents an O*(1.42ⁿ) time algorithm for the Maximum Cut problem on split graphs, along with a subexponential time algorithm for its decision variant.
No takes yet. Share an insight, caveat, or question.
Marko Lalovic (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: