This paper looks at the minimum weight bounded length circuit cover problem on rectangular grid graphs. We give a constructive procedure to determine an edge cover of the augemented Eulerian graph with circuits of fixed length.
|Publication status||Unpublished - 2013|
- minimum weight
- bounded length
- circuit cover problem
- grid graphs