Computing Pathwidth Faster Than 2 n (Q3656873): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62046054, #quickstatements; #temporary_batch_1706826130171 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:44, 5 February 2024
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
