Exact Algorithms for MaxCut on Split Graphs
<|reference_start|>Exact Algorithms for MaxCut on Split Graphs: 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.<|reference_end|>
@article{lalovic2024exact,
    title={Exact Algorithms for MaxCut on Split Graphs},
    author={Marko Lalovic},
    journal={arXiv preprint arXiv:2405.20599},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.20599},
    primaryClass={cs.DS}
}