scientific article; zbMATH DE number 1542607
From MaRDI portal
Publication:4520239
DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L" /><156::AID-NET2>3.0.CO;2-L 10.1002/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-LzbMath0963.68148MaRDI QIDQ4520239
Publication date: 12 December 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Proximity graphs inside large weighted graphs ⋮ Continuous-Time Moving Network Voronoi Diagram ⋮ Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks ⋮ Balancing graph Voronoi diagrams with one more vertex ⋮ Unveiling the truth in liquid democracy with misinformed voters ⋮ The weighted farthest color Voronoi diagram on trees and graphs. ⋮ Boosting the Exploration of Huge Dynamic Graphs ⋮ On small world non-Sunada twins and cellular Voronoi diagrams ⋮ The inverse Voronoi problem in graphs. I: Hardness ⋮ Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
Cites Work
- Unnamed Item
- Concrete and abstract Voronoi diagrams
- Shortest-path algorithms: Taxonomy and annotation
- Encoding shortest paths in spatial networks
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- A faster approximation algorithm for the Steiner problem in graphs
This page was built for publication:
