A distance approximating trees

  • Authors:

  • Vojtech Bálint

  • Affiliations:

  • Department of Mathematics, Faculty of Operation and Economics of Transport and Communications, University of ilina, Slovakia

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2008

Quantified Score

Hi-index 0.04

Visualization

Abstract

A 1-approximation of connected graph G=(V,E) is a tree T=(V,E^') with the same vertex set such that for every two vertices |d"G(u,v)-d"T(u,v)|=