| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427941 | Information Processing Letters | 2008 | 4 Pages |
Abstract
We introduce and solve a problem motivated by integrity verification in third-party data distribution: Given an undirected tree, find a minimum-cardinality set of simple paths that cover all the tree edges and, secondarily, have smallest total path lengths. We give a linear time algorithm for this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
