Spanners and Reachability Oracles for Directed Transmission Graphs

DOI10.4230/LIPICS.SOCG.2015.156MaRDI QIDQ5368683zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth

Publication date 10 October 2017

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.SOCG.2015.156

zbMATH Keywords

intersection graphreachability oraclesspannertransmission graphs

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Reachability oracles for directed transmission graphs
• Spanners for directed transmission graphs
• A note on reachability and distance oracles for transmission graphs
• Reachability problems for transmission graphs
• Reachability problems for transmission graphs
• Reachability Problems on Directed Graphs
• Reachability relations and the structure of transitive digraphs
• Fault tolerant reachability for directed graphs
• Improved Dynamic Reachability Algorithms for Directed Graphs
• scientific article; zbMATH DE number 4086991

Cited in

(7)

• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
• Reachability oracles for directed transmission graphs
• Spanners for directed transmission graphs
• Triangles and girth in disk graphs and transmission graphs
• Reachability problems for transmission graphs
• Reachability problems for transmission graphs
• A note on reachability and distance oracles for transmission graphs

This page was built for publication: Spanners and Reachability Oracles for Directed Transmission Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368683)