Computing tree-depth faster than \(2^n\) (Q493242)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing tree-depth faster than \(2^n\) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing tree-depth faster than \(2^n\) |
scientific article |
Statements
Computing tree-depth faster than \(2^n\) (English)
0 references
3 September 2015
0 references
exact algorithms
0 references
tree-depth
0 references
\(2^n\) barrier
0 references
