Sciweavers

Share
SIAMDM
2002

Finding a 2-Core of a Tree in Linear Time

10 years 2 months ago
Finding a 2-Core of a Tree in Linear Time
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where p 1 is an integer. In this paper, an O(n) time algorithm is proposed for the case p = 2, where n is the number of vertices in T. Our algorithm improves the two O(n2) time algorithms previously proposed by Becker and Perl [Discrete Appl. Math., 11 (1985), pp. 103
Biing-Feng Wang
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where SIAMDM
Authors Biing-Feng Wang
Comments (0)
books