Shortcut sets for plane Euclidean networks (extended abstract)

DOI10.1016/j.endm.2016.09.029zbMath1356.05142OpenAlexW2535052392MaRDI QIDQ510569

Yong-Cai Geng, Sumit K. Garg

Publication date: 13 February 2017

Full work available at URL: https://idus.us.es/handle//11441/98074

zbMATH Keywords

diameteraugmentation problemEuclidean networkshortcut set

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex degrees (05C07)

Related Items (3)

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut ⋮ Shortcuts for the circle ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Euclidean chains and their shortcuts
• The continuous center set of a network
• Visibility and intersection problems in plane geometry
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Network farthest-point diagrams
• Improving the Stretch Factor of a Geometric Network by Edge Augmentation
• The generalized diameter of a graph

This page was built for publication: Shortcut sets for plane Euclidean networks (extended abstract)