Computing Pathwidth Faster Than 2 n (Q3656873)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5658382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Pathwidth Faster Than 2 n |
scientific article; zbMATH DE number 5658382 |
Statements
Computing Pathwidth Faster Than 2 n (English)
0 references
14 January 2010
0 references
0 references
0 references
0 references
0.89350617
0 references
0.8903949
0 references
0.8713257
0 references
0.86831146
0 references
0.8636495
0 references
0 references
