Hop-spanners for geometric intersection graphs

MaRDI QIDQ6182145zbMATH OpenFDO

Authors Csaba D. Tóth

Publication date 20 December 2023

Full work available at URL https://arxiv.org/abs/2112.07158, https://jocg.org/index.php/jocg/article/view/4475/3398

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Hop-spanners for geometric intersection graphs
• Constant-hop spanners for more geometric intersection graphs, with even smaller size
• Sparse hop spanners for unit disk graphs
• Plane hop spanners for unit disk graphs
• Plane hop spanners for unit disk graphs: simpler and better

Cited in

(9)

• Plane hop spanners for unit disk graphs
• Spanners for geometric intersection graphs with applications
• Spanners for Geometric Intersection Graphs
• Geometric Intersection Graphs: Do Short Cycles Help?
• Hop-spanners for geometric intersection graphs
• Constant-hop spanners for more geometric intersection graphs, with even smaller size
• Sparse bounded hop-spanners for geometric intersection graphs
• Online hitting sets for disks of bounded radii
• Compact representation of semilinear and terrain-like graphs

This page was built for publication: Hop-spanners for geometric intersection graphs

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