Parameterized algorithms for maximum cut with connectivity constraints

Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We study two variants of Maximum Cut, which we call Connected Maximum Cut and Maximum Minimal Cut, in this paper. In these problems, given an unweighted graph, the goal is to compute a maximum cut satisfying some connectivity requirements. Both problems are known to be NP-complete even on planar graphs whereas Maximum Cut on planar graphs is solvable in polynomial time. We first show that these problems are NP-complete even on planar bipartite graphs and split graphs. Then we give parameterized algorithms using graph parameters such as clique-width, tree-width, and twin-cover number. Finally, we obtain FPT algorithms with respect to the solution size.

Original languageEnglish
Title of host publication14th International Symposium on Parameterized and Exact Computation, IPEC 2019
EditorsBart M. P. Jansen, Jan Arne Telle
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771290
DOIs
Publication statusPublished - Dec 2019
Event14th International Symposium on Parameterized and Exact Computation, IPEC 2019 - Munich, Germany
Duration: Sep 11 2019Sep 13 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume148
ISSN (Print)1868-8969

Conference

Conference14th International Symposium on Parameterized and Exact Computation, IPEC 2019
CountryGermany
CityMunich
Period9/11/199/13/19

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Parameterized algorithms for maximum cut with connectivity constraints'. Together they form a unique fingerprint.

Cite this