Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.10.032 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072279239 / rank | |||
Normal rank | |||
Revision as of 01:13, 20 March 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
