scientific article; zbMATH DE number 7779757
From MaRDI portal
Publication:6179341
DOI10.57717/cgt.v2i1.25arXiv2210.05788MaRDI QIDQ6179341
Publication date: 16 December 2023
Full work available at URL: https://arxiv.org/abs/2210.05788
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational geometryapproximate distance oraclesreachability oraclestransmission graphsclique-based seperators
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- All pairs shortest distances for graphs with small integer length edges
- New constructions of weak \(\varepsilon\)-nets
- Reachability oracles for directed transmission graphs
- Net and Prune
- Shortest path queries in planar graphs
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Separators for sphere-packings and nearest neighbor graphs
- Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff
- Spanners for Directed Transmission Graphs
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Reachability problems for transmission graphs
This page was built for publication:
