Finding a Two-Core of a Tree in Linear Time

Authors:
Biing-Feng Wang;Jyh-Jye Lin
Affiliations:
-;-
Venue:
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Year:
2000

Citing 7
Cited 0

Algorithms for a core and k-tree core of a tree

Journal of Algorithms
A linear time algorithm for finding a k-tree core

Journal of Algorithms
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel

IEEE Transactions on Parallel and Distributed Systems
Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network

Journal of Algorithms
Parallel Algorithms for the Tree Bisector Problem and Applications

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Finding the two-core of a tree

Discrete Applied Mathematics
An O(pn2) algorithm for the p -median and related problems on tree graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Let n be the number of vertices in T. In this paper, an O(n) time algorithm is proposed for the case p=2. Applying our 2-core algorithm as a procedure, we also show that the p-core problem can be solved in O(np-1) time for any constant p≥2.