A centroid labelling technique and its application to path selection in trees (Q5096953): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63307-3_75
+Normal rank
@@ Property / OpenAlex ID @@
+W74823494
@@ Property / OpenAlex ID: W74823494 / rank @@
+Normal rank
@@ Property / cites work @@
+Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
+Normal rank
@@ Property / cites work @@
+Finding kth paths and p-centers by generating and searching good data structures
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for r-dominating set and p-center problems on trees
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians
+Normal rank
@@ Property / cites work @@
+An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
+Normal rank
@@ Property / cites work @@
+Optimal parallel selection in sorted matrices
@@ Property / cites work: Optimal parallel selection in sorted matrices / rank @@
+Normal rank