Proximity graphs inside large weighted graphs
From MaRDI portal
Recommendations
- Proximity, remoteness and girth in graphs
- Weighted graphs with distances in given ranges
- Proximity and remoteness in directed and undirected graphs
- scientific article; zbMATH DE number 446260
- On proximity measures for graph vertices
- Proximity and remoteness in graphs: results and conjectures
- Proximity structures for geometric graphs
- Proximity, remoteness and maximum degree in graphs
- Mutual witness proximity graphs
Cites work
- A faster approximation algorithm for the Steiner problem in graphs
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- Abstract sphere-of-influence graphs
- An optimal minimum spanning tree algorithm
- CONSTRUCTING OPTIMAL HIGHWAYS
- Foundations of multidimensional and metric data structures.
- Hardness results for computing optimal locally Gabriel graphs
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 1542607 (Why is no real title available?)
- scientific article; zbMATH DE number 1746883 (Why is no real title available?)
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- On locally Delaunay geometric graphs
- Proximity structures for geometric graphs
- The transportation metric and related problems
- The weighted farthest color Voronoi diagram on trees and graphs.
- Voronoi diagram for services neighboring a highway
This page was built for publication: Proximity graphs inside large weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326777)
