Exact Algorithms for MaxCut on Split Graphs
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929367825776640 |
|---|---|
| author | Lalovic, Marko |
| author_facet | Lalovic, Marko |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_20599 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exact Algorithms for MaxCut on Split Graphs Lalovic, Marko Data Structures and Algorithms 05C85 (Primary) 68R10, 68W05 (Secondary) F.2.2; G.2.2 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. |
| title | Exact Algorithms for MaxCut on Split Graphs |
| topic | Data Structures and Algorithms 05C85 (Primary) 68R10, 68W05 (Secondary) F.2.2; G.2.2 |
| url | https://arxiv.org/abs/2405.20599 |