Linear-Time algorithms for tree root problems

  • Authors:

  • Maw-Shang Chang;Ming-Tat Ko;Hsueh-I Lu

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Shiun, Chiayi, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

  • Venue:
  • SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let T be a tree on a set V of nodes. The p-th powerTp of T is the graph on V such that any two nodes u and w of V are adjacent in Tp if and only if the distance of u and w in T is at most p. Given an n-node m-edge graph G and a positive integer p, the p-th tree root problem asks for a tree T, if any, such that G=Tp. Given a graph G, the tree root problem asks for a positive integer p and a tree T, if any, such that G=Tp. Kearney and Corneil gave the best previously known algorithms for both problems. Their algorithm for the former (respectively, latter) problem runs in O(n3) (respectively, O(n4)) time. In this paper, we give O(n+m)-time algorithms for both problems