Exact Algorithms for MaxCut on Split Graphs
Marko Lalovic
TL;DR
This paper introduces efficient exact algorithms for solving the MaxCut problem specifically on split graphs, achieving improved exponential and subexponential time complexities.
Contribution
It provides the first $O^{*}(1.42^{n})$ time algorithm for MaxCut on split graphs and a subexponential algorithm for the decision variant.
Findings
Achieved an $O^{*}(1.42^{n})$ time algorithm for MaxCut on split graphs.
Developed a subexponential time algorithm for MaxCut decision problem.
Demonstrated improved algorithmic complexity for MaxCut on split graphs.
Abstract
This paper presents an time algorithm for the Maximum Cut problem on split graphs, along with a subexponential time algorithm for its decision variant.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Graph Theory and Algorithms · Advanced Graph Theory Research