On the maximum weight minimal separator

Tesshu Hanaka, Hans L. Bodlaender, Tom C. Van Der Zanden, Hirotaka Ono

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

2 被引用数 (Scopus)

抄録

Given an undirected and connected graph G = (V, E) and two vertices s, t ∈ V, a vertex subset S that separates s and t is called an s-t separator, and an s-t separator is called minimal if no proper subset of S separates s and t. In this paper, we consider finding a minimal s-t separator with maximum weight on a vertex-weighted graph. We first prove that this problem is NP-hard. Then, we propose an twO(tw) n-time deterministic algorithm based on tree decompositions. Moreover, we also propose an O (9tw W2)-time randomized algorithm to determine whether there exists a minimal s-t separator where W is its weight and tw is the treewidth of G.

本文言語英語
ホスト出版物のタイトルTheory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings
編集者Gerhard Jager, Silvia Steila, T.V. Gopal
出版社Springer Verlag
ページ304-318
ページ数15
ISBN(印刷版)9783319559100
DOI
出版ステータス出版済み - 2017
イベント14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 - Bern, スイス
継続期間: 4月 20 20174月 22 2017

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10185 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

会議

会議14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017
国/地域スイス
CityBern
Period4/20/174/22/17

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On the maximum weight minimal separator」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル