English

Exact Algorithms for MaxCut on Split Graphs

Data Structures and Algorithms 2024-06-03 v1

Abstract

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

Keywords

Cite

@article{arxiv.2405.20599,
  title  = {Exact Algorithms for MaxCut on Split Graphs},
  author = {Marko Lalovic},
  journal= {arXiv preprint arXiv:2405.20599},
  year   = {2024}
}

Comments

8 pages, 4 figures