Computing optimal shortcuts for networks (Q2001454): Difference between revisions

@@ Property / author @@
+Alberto Márquez
@@ Property / author: Alberto Márquez / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2884437184
@@ Property / OpenAlex ID: W2884437184 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.10093
@@ Property / arXiv ID: 1807.10093 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5136224
@@ Property / cites work: Q5136224 / rank @@
+Normal rank
@@ Property / cites work @@
+Lowest common ancestors in trees and directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Star-Tree Parallel Data Structure
@@ Property / cites work: Recursive Star-Tree Parallel Data Structure / rank @@
+Normal rank
@@ Property / cites work @@
+Shortcut sets for the locus of plane Euclidean networks
+Normal rank
@@ Property / cites work @@
+Q5369529
@@ Property / cites work: Q5369529 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the continuous diameter when augmenting a tree with a shortcut
+Normal rank
@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+The generalized diameter of a graph
@@ Property / cites work: The generalized diameter of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A review of urban transportation network design problems
+Normal rank
@@ Property / cites work @@
+Improving the Stretch Factor of a Geometric Network by Edge Augmentation
+Normal rank
@@ Property / cites work @@
+Generalized network design problems.
@@ Property / cites work: Generalized network design problems. / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting graphs to minimize the diameter
@@ Property / cites work: Augmenting graphs to minimize the diameter / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Simplified linear-time Jordan sorting and polygon clipping
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Diameter-Optimally Augmenting Paths
+Normal rank
@@ Property / cites work @@
+The continuous center set of a network
@@ Property / cites work: The continuous center set of a network / rank @@
+Normal rank
@@ Property / cites work @@
+Plane Geometric Graph Augmentation: A Generic Perspective
+Normal rank
@@ Property / cites work @@
+A bi-objective turning restriction design problem in urban road networks
+Normal rank
@@ Property / cites work @@
+Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
+Normal rank
@@ Property / cites work @@
+A sustainable road network design problem with land use transportation interaction over time
+Normal rank
@@ Property / cites work @@
+Computing the dilation of edge-augmented graphs in metric spaces
+Normal rank
@@ Property / cites work @@
+Euclidean chains and their shortcuts
@@ Property / cites work: Euclidean chains and their shortcuts / rank @@
+Normal rank