Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668)
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 5523154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width |
scientific article; zbMATH DE number 5523154 |
Statements
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (English)
0 references
4 March 2009
0 references
tree-width
0 references
polynomial algorithms
0 references
cycle cover
0 references
Chinese postman problem
0 references
mixed graphs
0 references
0.8264737725257874
0 references
0.8204578161239624
0 references
0.8182843923568726
0 references
0.7920868992805481
0 references
