The nearest colored node in a tree (Q1698706): Difference between revisions

@@ Property / Wikidata QID @@
+Q60143007
@@ Property / Wikidata QID: Q60143007 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Nearest Neighbor Search in Metrics of Planar Graphs
+Normal rank
@@ Property / cites work @@
+Maintaining information in fully dynamic trees with top trees
+Normal rank
@@ Property / cites work @@
+Optimal Lower and Upper Bounds for Representing Sequences
+Normal rank
@@ Property / cites work @@
+Lowest common ancestors in trees and directed acyclic graphs
+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 @@
+Compressed subsequence matching and packed tree coloring
+Normal rank
@@ Property / cites work @@
+Random Access to Grammar-Compressed Strings and Trees
+Normal rank
@@ Property / cites work @@
+Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
+Normal rank
@@ Property / cites work @@
+Dynamic Perfect Hashing: Upper and Lower Bounds
@@ Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Distance Oracles for Vertex-Labeled Graphs
@@ Property / cites work: Distance Oracles for Vertex-Labeled Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+(1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs
+Normal rank
@@ Property / cites work @@
+The Power of Dynamic Distance Oracles
@@ Property / cites work: The Power of Dynamic Distance Oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient vertex-label distance oracles for planar graphs
+Normal rank
@@ Property / cites work @@
+Q4875167
@@ Property / cites work: Q4875167 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-space trade-offs for predecessor search
@@ Property / cites work: Time-space trade-offs for predecessor search / rank @@
+Normal rank
@@ Property / cites work @@
+Design and implementation of an efficient priority queue
+Normal rank
@@ Property / cites work @@
+Amortized Bounds for Dynamic Orthogonal Range Reporting
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank