Article ID: | iaor20053270 |
Country: | Germany |
Volume: | 38 |
Issue: | 3 |
Start Page Number: | 441 |
End Page Number: | 449 |
Publication Date: | Dec 2003 |
Journal: | Algorithmica |
Authors: | Sinha Amitabh, Knemann Jochen, Parekh Ojas, Konjevod Goran |
Keywords: | networks: path |
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph. Arkin