Parameterized algorithms for maximum cut with connectivity constraints

Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

8 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトル14th International Symposium on Parameterized and Exact Computation, IPEC 2019
編集者Bart M. P. Jansen, Jan Arne Telle
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771290
DOI
出版ステータス出版済み - 12 2019
イベント14th International Symposium on Parameterized and Exact Computation, IPEC 2019 - Munich, ドイツ
継続期間: 9 11 20199 13 2019

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
148
ISSN(印刷版)1868-8969

会議

会議14th International Symposium on Parameterized and Exact Computation, IPEC 2019
国/地域ドイツ
CityMunich
Period9/11/199/13/19

All Science Journal Classification (ASJC) codes

  • ソフトウェア

フィンガープリント

「Parameterized algorithms for maximum cut with connectivity constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル