Finding small-width connected path decompositions in polynomial time (Q2328867)
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 7118040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding small-width connected path decompositions in polynomial time |
scientific article; zbMATH DE number 7118040 |
Statements
Finding small-width connected path decompositions in polynomial time (English)
0 references
16 October 2019
0 references
connected graph searching
0 references
connected pathwidth
0 references
graph searching
0 references
pathwidth
0 references
0 references
0 references
0.8746708035469055
0 references
0.8745043873786926
0 references
0.8303824663162231
0 references
0.8127516508102417
0 references
0.7942312955856323
0 references
