On the maximum weight minimal separator

Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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. Moreover, we say that a set S is a minimal separator of G if S is a minimal s-t separator for some 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 these problems are NP-hard. On the other hand, we give an O⁎(twO(tw))-time deterministic algorithm based on tree decompositions where O⁎ is the order notation omitting the polynomial factor of n. Moreover, we improve the algorithm by using the Rank-Based approach and the running time is O⁎(38⋅2ω)tw. Finally, we give 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.
Original languageEnglish
Pages (from-to)294-308
Number of pages15
JournalTheoretical Computer Science
Volume796
DOIs
Publication statusPublished - 3 Dec 2019

Keywords

  • Parameterized algorithm
  • Minimal separator
  • Treewidth
  • TREEWIDTH
  • FILL-IN

Cite this

Hanaka, Tesshu ; Bodlaender, Hans L. ; van der Zanden, Tom C. ; Ono, Hirotaka. / On the maximum weight minimal separator. In: Theoretical Computer Science. 2019 ; Vol. 796. pp. 294-308.
@article{863cd47e32114b9dbea650479e297148,
title = "On the maximum weight minimal separator",
abstract = "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. Moreover, we say that a set S is a minimal separator of G if S is a minimal s-t separator for some 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 these problems are NP-hard. On the other hand, we give an O⁎(twO(tw))-time deterministic algorithm based on tree decompositions where O⁎ is the order notation omitting the polynomial factor of n. Moreover, we improve the algorithm by using the Rank-Based approach and the running time is O⁎(38⋅2ω)tw. Finally, we give 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.",
keywords = "Parameterized algorithm, Minimal separator, Treewidth, TREEWIDTH, FILL-IN",
author = "Tesshu Hanaka and Bodlaender, {Hans L.} and {van der Zanden}, {Tom C.} and Hirotaka Ono",
note = "data:no data used",
year = "2019",
month = "12",
day = "3",
doi = "10.1016/j.tcs.2019.09.025",
language = "English",
volume = "796",
pages = "294--308",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier Science",

}

On the maximum weight minimal separator. / Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka.

In: Theoretical Computer Science, Vol. 796, 03.12.2019, p. 294-308.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - On the maximum weight minimal separator

AU - Hanaka, Tesshu

AU - Bodlaender, Hans L.

AU - van der Zanden, Tom C.

AU - Ono, Hirotaka

N1 - data:no data used

PY - 2019/12/3

Y1 - 2019/12/3

N2 - 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. Moreover, we say that a set S is a minimal separator of G if S is a minimal s-t separator for some 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 these problems are NP-hard. On the other hand, we give an O⁎(twO(tw))-time deterministic algorithm based on tree decompositions where O⁎ is the order notation omitting the polynomial factor of n. Moreover, we improve the algorithm by using the Rank-Based approach and the running time is O⁎(38⋅2ω)tw. Finally, we give 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.

AB - 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. Moreover, we say that a set S is a minimal separator of G if S is a minimal s-t separator for some 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 these problems are NP-hard. On the other hand, we give an O⁎(twO(tw))-time deterministic algorithm based on tree decompositions where O⁎ is the order notation omitting the polynomial factor of n. Moreover, we improve the algorithm by using the Rank-Based approach and the running time is O⁎(38⋅2ω)tw. Finally, we give 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.

KW - Parameterized algorithm

KW - Minimal separator

KW - Treewidth

KW - TREEWIDTH

KW - FILL-IN

U2 - 10.1016/j.tcs.2019.09.025

DO - 10.1016/j.tcs.2019.09.025

M3 - Article

VL - 796

SP - 294

EP - 308

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -