The mixed Chinese postman problem parameterized by pathwidth and treedepth (Q2835842)
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 6658058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The mixed Chinese postman problem parameterized by pathwidth and treedepth |
scientific article; zbMATH DE number 6658058 |
Statements
30 November 2016
0 references
Chinese Postman
0 references
mixed graphs
0 references
pathwidth
0 references
treedepth
0 references
0 references
The mixed Chinese postman problem parameterized by pathwidth and treedepth (English)
0 references
0.9817176461219788
0 references
0.916893482208252
0 references
0.9162147641181946
0 references
0.8264737725257874
0 references
0.8257796168327332
0 references
