Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:54, 30 January 2024
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
