Finding All Leftmost Separators of Size ≤ k

by   Mahdi Belbasi, et al.

We define a notion called leftmost separator of size at most k. A leftmost separator of size k is a minimal separator S that separates two given sets of vertices X and Y such that we "cannot move S more towards X" such that |S| remains smaller than the threshold. One of the incentives is that by using leftmost separators we can improve the time complexity of treewidth approximation. Treewidth approximation is a problem which is known to have a linear time FPT algorithm in terms of input size, and only single exponential in terms of the parameter, treewidth. It is not known whether this result can be improved theoretically. However, the coefficient of the parameter k (the treewidth) in the exponent is large. Hence, our goal is to decrease the coefficient of k in the exponent, in order to achieve a more practical algorithm. Hereby, we trade a linear-time algorithm for an 𝒪(n log n)-time algorithm. The previous known 𝒪(f(k) n log n)-time algorithms have dependences of 2^24kk!, 2^8.766kk^2 (a better analysis shows that it is 2^7.671kk^2), and higher. In this paper, we present an algorithm for treewidth approximation which runs in time 𝒪(2^6.755k n log n), Furthermore, we count the number of leftmost separators and give a tight upper bound for them. We show that the number of leftmost separators of size ≤ k is at most C_k-1 (Catalan number). Then, we present an algorithm which outputs all leftmost separators in time 𝒪(4^k/√(k)n).



There are no comments yet.


page 1

page 2

page 3

page 4


Graph isomorphism in quasipolynomial time parameterized by treewidth

We extend Babai's quasipolynomial-time graph isomorphism test (STOC 2016...

Knot Diagrams of Treewidth Two

In this paper, we study knot diagrams for which the underlying graph has...

Upper Tail Analysis of Bucket Sort and Random Tries

Bucket Sort is known to run in expected linear time when the input keys ...

An Improvement of Reed's Treewidth Approximation

We present a new approximation algorithm for the treewidth problem which...

A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path

Arising from structural graph theory, treewidth has become a focus of st...

On the Size of Minimal Separators for Treedepth Decomposition

Treedepth decomposition has several practical applications and can be us...

Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs

In this paper, we show that the Cutwidth, Modified Cutwidth, and Vertex ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.