Shortcut sets for the locus of plane Euclidean networks

DOI10.1016/j.amc.2018.04.010zbMath1427.05215arXiv1604.03878OpenAlexW2962910869MaRDI QIDQ2335528

María Luz Puertas, Delia Garijo, Paula Ribeiro, Antonio González, Alberto Márquez, Jose Cáceres

Publication date: 14 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.03878

zbMATH Keywords

diameternetwork designaugmentation problemshortcut seteuclidean network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Computing optimal shortcuts for networks, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Euclidean chains and their shortcuts
• Linear time algorithm for optimal feed-link placement
• Augmenting graphs to minimize the diameter
• The continuous center set of a network
• Visibility and intersection problems in plane geometry
• Sparse geometric graphs with small dilation
• Computing the dilation of edge-augmented graphs in metric spaces
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• How to decrease the diameter of triangle-free graphs
• Spanners and message distribution in networks.
• On the complexity of locating linear facilities in the plane
• Minimizing the continuous diameter when augmenting a tree with a shortcut
• Identification of influential spreaders based on classified neighbors in real-world complex networks
• Plane Geometric Graph Augmentation: A Generic Perspective
• Network farthest-point diagrams
• Fast Algorithms for Diameter-Optimally Augmenting Paths
• Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
• Improving the Stretch Factor of a Geometric Network by Edge Augmentation
• The generalized diameter of a graph