Complexity of finding embeddings in a k -tree

Stefan Arnborg, Derek G Corneil, Andrzej Proskurowski · 1987

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

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 1
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.