Finding all leftmost separators of size k

Mahdi Belbasi · 2021 · Lecture notes in computer science · DOI 10.1007/978-3-030-92681-6

1 Pith paper cite this work, alongside 6 external citations. Polarity classification is still indexing.

1 Pith paper citing it

6 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2024-11-25 · conditional · novelty 7.0

A new FPT algorithm approximates treewidth within a factor of 2 in O(poly(k) 81^k n) time, improving the previous 1728^k bound.

Showing 1 of 1 citing paper.

Optimized 2-Approximation of Treewidth cs.DS · 2024-11-25 · conditional · none · ref 2
A new FPT algorithm approximates treewidth within a factor of 2 in O(poly(k) 81^k n) time, improving the previous 1728^k bound.