Published in

Wiley, Networks, 1(61), p. 29-39, 2012

DOI: 10.1002/net.21464

Links

Tools

Export citation

Search in Google Scholar

Proximity graphs inside large weighted graphs

Journal article published in 2012 by Bernardo M. Ábrego, Ruy Fabila-Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Henk Meijer, Vera Sacristán ORCID, Maria Saumell
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Given a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path distance in G and generalize the proximity rules that generate some of the most common proximity graphs in Euclidean spaces. We prove basic properties of the de¯ned graphs and provide algorithms for their computation. Postprint (published version)