Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2010.03.001
@@ Property / DOI: 10.1016/j.jda.2010.03.001 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2010.03.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2054204720
@@ Property / OpenAlex ID: W2054204720 / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse spanners of weighted graphs
@@ Property / cites work: On sparse spanners of weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552048
@@ Property / cites work: Q4552048 / rank @@
+Normal rank
@@ Property / cites work @@
+The buffer tree: A technique for designing batched external data structures
+Normal rank
@@ Property / cites work @@
+An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
+Normal rank
@@ Property / cites work @@
+Q4234097
@@ Property / cites work: Q4234097 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4425956
@@ Property / cites work: Q4425956 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737177
@@ Property / cites work: Q4737177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952671
@@ Property / cites work: Q4952671 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140432
@@ Property / cites work: Q3140432 / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition of multidimensional point sets with applications to             <i>k</i>             -nearest-neighbors and             <i>n</i>             -body potential fields
+Normal rank
@@ Property / cites work @@
+NEW SPARSENESS RESULTS ON GRAPH SPANNERS
@@ Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for computing geometric spanners and approximate shortest paths
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for Constructing Sparse Euclidean Spanners
+Normal rank
@@ Property / cites work @@
+Q4945509
@@ Property / cites work: Q4945509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501331
@@ Property / cites work: Q5501331 / rank @@
+Normal rank
@@ Property / cites work @@
+A Data Structure for Dynamically Maintaining Rooted Trees
+Normal rank
@@ Property / cites work @@
+I/O-efficient well-separated pair decomposition and applications
+Normal rank
@@ Property / cites work @@
+Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
+Normal rank
@@ Property / cites work @@
+Q4829019
@@ Property / cites work: Q4829019 / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+I/O-Efficiently Pruning Dense Spanners
@@ Property / cites work: I/O-Efficiently Pruning Dense Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Q4428992
@@ Property / cites work: Q4428992 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for constructing fault-tolerant spanners
+Normal rank
@@ Property / cites work @@
+Q4474222
@@ Property / cites work: Q4474222 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4778563
@@ Property / cites work: Q4778563 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945521
@@ Property / cites work: Q4945521 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4428993
@@ Property / cites work: Q4428993 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures for External Memory
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2010.03.001
@@ Property / DOI: 10.1016/J.JDA.2010.03.001 / rank @@
+Normal rank