Computing Pathwidth Faster Than 2 n (Q3656873)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Pathwidth Faster Than 2 n |
scientific article |
Statements
Computing Pathwidth Faster Than 2 n (English)
0 references
14 January 2010
0 references
