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 this page instead for the normal view: Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width |
scientific article |
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
