Reachability problems for transmission graphs

DOI10.1007/s00453-022-00985-1OpenAlexW3170792193MaRDI QIDQ5918537

Shinwoo An, Eunjin Oh

Publication date: 6 October 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00985-1

zbMATH Keywords

geometric intersection graphsreachability oraclestransmission graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separator theorems and Turán-type results for planar intersection graphs
• Routing in unit disk graphs
• Relaxed spanners for directed disk graphs
• Near-optimal algorithms for shortest paths in weighted unit-disk graphs
• Shortest paths in intersection graphs of unit disks
• Voronoi Diagram in the Laguerre Geometry and Its Applications
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
• Spanners for Directed Transmission Graphs
• Approximate distance oracles for geometric spanners
• Spanners and Reachability Oracles for Directed Transmission Graphs
• On Generalized Planar Skyline and Convex Hull Range Queries
• Shortest-Path Queries in Geometric Networks

This page was built for publication: Reachability problems for transmission graphs