Skip to main content
Article thumbnail
Location of Repository

By 

Abstract

Given a graph G = (V, E) whose edges have lengths, we denote the distance between two vertices u and v by d(u, v). For any vertex u ∈ V and any real number r, we define N(u, r) as the set of vertices within distance r from u. We study th

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.9183
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.paradise.caltech.ed... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.