The complexity of minimum-length path decompositions (Q494076)
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: The complexity of minimum-length path decompositions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of minimum-length path decompositions |
scientific article |
Statements
The complexity of minimum-length path decompositions (English)
0 references
31 August 2015
0 references
graph searching
0 references
path decomposition
0 references
pathwidth
0 references
0.8012498617172241
0 references
0.8012015223503113
0 references
0.783515214920044
0 references
0.7830231189727783
0 references
