Computing directed pathwidth in \(O(1.89^n)\) time (Q300464)
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 directed pathwidth in O(1.89ⁿ) time |
scientific article; zbMATH DE number 6599025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing directed pathwidth in \(O(1.89^n)\) time |
scientific article; zbMATH DE number 6599025 |
Statements
Computing directed pathwidth in \(O(1.89^n)\) time (English)
0 references
28 June 2016
0 references
exact exponential algorithm
0 references
graph algorithm
0 references
pathwidth
0 references
0 references
0.998646914958954
0 references
0.8838968873023987
0 references
0.8761897087097168
0 references
0.8560836315155029
0 references
0.8307849168777466
0 references
