Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
EuroCG 2010, Dortmund, Germany, March 2224, 2010 Proximity Graphs inside Large Weighted Graphs
 

Summary: EuroCG 2010, Dortmund, Germany, March 22­24, 2010
Proximity Graphs inside Large Weighted Graphs
Bernardo M. ŽAbrego
Ruy Fabila-Monroy
Silvia FernŽandez-Merchant
David Flores-Pe~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.

  

Source: Abrego, Bernardo - Department of Mathematics, California State University, Northridge
Fernandez, Silvia - Department of Mathematics, California State University, Northridge

 

Collections: Mathematics