Adjacency queries in dynamic sparse graphs (Q846004): Difference between revisions

@@ Property / cites work @@
+Tight(er) worst-case bounds on dynamic searching and priority queues
+Normal rank
@@ Property / cites work @@
+Optimal bounds for the predecessor problem and related problems
+Normal rank
@@ Property / cites work @@
+Q3024792
@@ Property / cites work: Q3024792 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar orientations with low out-degree and compaction of adjacency matrices
+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 @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Oracles for bounded-length shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+On the Complexity of a Game Related to the Dictionary Problem
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank