Shortcut sets for the locus of plane Euclidean networks (Q2335528): Difference between revisions

@@ Property / author @@
+Jose Cáceres
@@ Property / author: Jose Cáceres / rank @@
+Normal rank
@@ 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 @@
+W2962910869
@@ Property / OpenAlex ID: W2962910869 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03878
@@ Property / arXiv ID: 1604.03878 / rank @@
+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 @@
+Q5369529
@@ Property / cites work: Q5369529 / rank @@
+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 @@
+Network farthest-point diagrams
@@ Property / cites work: Network farthest-point diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithm for optimal feed-link placement
+Normal rank
@@ Property / cites work @@
+Identification of influential spreaders based on classified neighbors in real-world complex networks
+Normal rank
@@ Property / cites work @@
+Sparse geometric graphs with small dilation
@@ Property / cites work: Sparse geometric graphs with small dilation / rank @@
+Normal rank
@@ Property / cites work @@
+Spanners and message distribution in networks.
@@ Property / cites work: Spanners and message distribution in networks. / rank @@
+Normal rank
@@ Property / cites work @@
+How to decrease the diameter of triangle-free graphs
+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 Diameter-Optimally Augmenting Paths
+Normal rank
@@ Property / cites work @@
+Plane Geometric Graph Augmentation: A Generic Perspective
+Normal rank
@@ Property / cites work @@
+Improving the Stretch Factor of a Geometric Network by Edge Augmentation
+Normal rank
@@ Property / cites work @@
+Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
+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
@@ Property / cites work @@
+Minimizing the continuous diameter when augmenting a tree with a shortcut
+Normal rank
@@ Property / cites work @@
+Q5136224
@@ Property / cites work: Q5136224 / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+Arrangements of curves in the plane --- topology, combinatorics, and algorithms
+Normal rank
@@ Property / cites work @@
+On the complexity of locating linear facilities in the plane
+Normal rank
@@ Property / Wikidata QID @@
+Q129918665
@@ Property / Wikidata QID: Q129918665 / rank @@
+Normal rank