Skip to content
Log in
Toggle navigation
Datasets
Organizations
Groups
About
Search Datasets
Home
Datasets
Order by
Relevance
Name Ascending
Name Descending
Last Modified
Go
1 dataset found
Tags:
minimal-separators
Filter Results
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In
We show that for a graph $G$ on $n$ vertices its treewidth can be computed in $\mathcal{O}(poly(n) 1.9601^n)$ time. Our result is based on combinatorial upper bounds...
HTML
You can also access this registry using the
API
(see
API Docs
).
