Computing Tree-Depth Faster Than 2 n (Q2867079)
From MaRDI portal
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
10 December 2013
0 references
