Proximity graphs inside large weighted graphs

DOI10.1002/net.21464zbMath1269.05048OpenAlexW2171732290MaRDI QIDQ5326777

Vera Sacristán, Silvia Fernández-Merchant, Ferran Hurtado, Maria Saumell, Ruy Fabila-Monroy, Henk G. Meijer, Bernardo M. Ábrego, David Flores-Peñaloza

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/8730

zbMATH Keywords

algorithmsweighted graphsVoronoi diagramsneighborhoodshortest path distanceproximity graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Voronoi diagram for services neighboring a highway
• The transportation metric and related problems
• Abstract sphere-of-influence graphs
• The weighted farthest color Voronoi diagram on trees and graphs.
• Foundations of multidimensional and metric data structures.
• HARDNESS RESULTS FOR COMPUTING OPTIMAL LOCALLY GABRIEL GRAPHS
• More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
• An optimal minimum spanning tree algorithm
• CONSTRUCTING OPTIMAL HIGHWAYS
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• PROXIMITY STRUCTURES FOR GEOMETRIC GRAPHS
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs
• On locally Delaunay geometric graphs
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: Proximity graphs inside large weighted graphs