Vertex Fault-Tolerant Geometric Spanners for Weighted Points
From MaRDI portal
Publication:6173263
DOI10.1142/s021819592250008xzbMath1523.68127arXiv2011.03354OpenAlexW4311159574MaRDI QIDQ6173263
Sukanya Bhattacharjee, Rajasekhar Inkulu
Publication date: 21 July 2023
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.03354
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On bounded degree plane strong geometric spanners
- Kinetic spanners in \(\mathbb R^{d}\)
- Geometric spanners for weighted point sets
- Spanners of additively weighted point sets
- Stable roommates spanner
- Constructing plane spanners of bounded degree and low weight
- Minimum power assignment in wireless ad hoc networks with spanner property
- Sparse geometric graphs with small dilation
- Geometric spanners with small chromatic number
- Region-fault tolerant geometric spanners
- Classes of graphs which approximate the complete Euclidean graph
- On sparse spanners of weighted graphs
- Spanners for geodesic graphs and visibility graphs
- On plane constrained bounded-degree spanners
- Fault-tolerant geometric spanners
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
- There are planar graphs almost as good as the complete graph
- Computing the greedy spanner in near-quadratic time
- Fault-tolerant additive weighted geometric spanners
- Efficient construction of a bounded-degree spanner with low weight
- New Doubling Spanners: Better and Simpler
- An optimal algorithm for computing angle-constrained spanners
- Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
- Geometric Spanner Networks
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- Bypassing the embedding
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
- Graph spanners
- A Separator Theorem for Planar Graphs
- Planar Separators
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- Planar spanners and approximate shortest path queries among obstacles in the plane
- On Hierarchical Routing in Doubling Metrics
- Truly Optimal Euclidean Spanners
- Geodesic Spanners for Points on a Polyhedral Terrain
- From hierarchical partitions to hierarchical covers
- Small hop-diameter sparse spanners for doubling metrics
- A simple and efficient kinetic spanner
- Improved algorithms for constructing fault-tolerant spanners
