Computing optimal shortcuts for networks

DOI10.4230/LIPICS.ISAAC.2018.15MaRDI QIDQ5091005zbMATH OpenFDO

Authors Delia Garijo, Natalia Rodríguez, Rodrigo I. Silveira, A. Márquez

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2018.15

zbMATH Keywords

diametergeometric graphgraph augmentationshortcut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Computing optimal shortcuts for networks
• Shortcut sets for plane Euclidean networks (extended abstract)
• Shortcut sets for the locus of plane Euclidean networks
• Finding the best shortcut in a geometric network
• scientific article; zbMATH DE number 6792403

Cites work

• Computational geometry. Algorithms and applications.
• Euclidean chains and their shortcuts
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• scientific article; zbMATH DE number 6792403 (Why is no real title available?)
• Lowest common ancestors in trees and directed acyclic graphs
• Minimizing the continuous diameter when augmenting a tree with a shortcut
• Plane geometric graph augmentation: a generic perspective
• Recursive Star-Tree Parallel Data Structure
• Shortcut sets for the locus of plane Euclidean networks
• Shortcuts for the circle
• Simplified linear-time Jordan sorting and polygon clipping
• The continuous center set of a network
• The generalized diameter of a graph

Cited in

(5)

• Upgrading Shortest Paths in Networks
• scientific article; zbMATH DE number 434492 (Why is no real title available?)
• scientific article; zbMATH DE number 1990700 (Why is no real title available?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• Link-Length Minimization in Networks

This page was built for publication: Computing optimal shortcuts for networks

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