 
Summary: EuroCG 2010, Dortmund, Germany, March 2224, 2010
Proximity Graphs inside Large Weighted Graphs
Bernardo M. ŽAbrego
Ruy FabilaMonroy
Silvia FernŽandezMerchant
David FloresPe~naloza
Ferran Hurtado§
Henk Meijer¶
Vera SacristŽan§
Maria Saumell§
Abstract
Given a large weighted graph G = (V, E) and a subset
U of V , we define several graphs with vertex set U in
which two vertices are adjacent if they satisfy some
prescribed proximity rule. These rules use the short
est path distance in G and generalize the proximity
rules that generate some of the most common proxim
ity graphs in Euclidean spaces. We prove basic prop
erties of the defined graphs and provide algorithms
for their computation.
