Finding the two-core of a tree

  • Authors:

  • Ronald I. Becker;Yehoshua Perl

  • Affiliations:

  • Department of Mathematics, University of Cape Town, Rondebosch 7700, Republic of South Africa and Department of Mathematics, University of Tennessee, Knoxville, TN 37996-1300, USA;Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA and Bar-Ilan University, Ramat Gran, Israel

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 1985

Quantified Score

Hi-index 0.05

Visualization

Abstract

The 1-core of a graph is a path minimizing the sum of the distances of all vertices of the graph from the path. A linear algorithm for finding a 1-core of a tree was presented by Morgan and Slater. The problem for general graphs is NP-hard. A 2-core of a graph is a set of two paths minimizing the sum of the distances of all vertices of the graph from any of the two paths. We consider both cases of disjoint paths and intersecting paths for a tree. Interesting relations between 1-core and 2-core of a tree are found. These relations imply two efficient algorithms for finding the 2-core. The complexity of these algorithms is O(|V|^2) and O(|V| . d(T)), respectively, where d(T) is the number of edges in the diameter of the tree. The algorithms are applicable for routing highways in a system of roads. A w-point core is a path minimizing the sum of the distances of all vertices of the graph from either the vertex w or the path. A linear algorithm for finding a w-point core of a tree is presented. It is applied as a procedure in the second algorithm for the 2-core.