A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph (Q2391712): Difference between revisions

@@ Property / cites work @@
+Q5501304
@@ Property / cites work: Q5501304 / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining information in fully dynamic trees with top trees
+Normal rank
@@ Property / cites work @@
+Reeb graphs for shape analysis and applications
@@ Property / cites work: Reeb graphs for shape analysis and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Computing contour trees in all dimensions
@@ Property / cites work: Computing contour trees in all dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+Loops in reeb graphs of 2-manifolds
@@ Property / cites work: Loops in reeb graphs of 2-manifolds / rank @@
+Normal rank
@@ Property / cites work @@
+Reeb graphs
@@ Property / cites work: Reeb graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for computing Reeb graphs
@@ Property / cites work: Efficient algorithms for computing Reeb graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Time-varying Reeb graphs for continuous space-time data
+Normal rank
@@ Property / cites work @@
+Reeb spaces of piecewise linear mappings
@@ Property / cites work: Reeb spaces of piecewise linear mappings / rank @@
+Normal rank
@@ Property / cites work @@
+Offline Algorithms for Dynamic Minimum Spanning Tree Problems
+Normal rank
@@ Property / cites work @@
+A randomized             <i>O</i>             (             <i>m</i>             log             <i>m</i>             ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Logarithmic Lower Bounds in the Cell-Probe Model
@@ Property / cites work: Logarithmic Lower Bounds in the Cell-Probe Model / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921745
@@ Property / cites work: Q2921745 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic trees in practice
@@ Property / cites work: Dynamic trees in practice / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal fully-dynamic graph connectivity
@@ Property / cites work: Near-optimal fully-dynamic graph connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+THE AUGMENTED MULTIRESOLUTION REEB GRAPH APPROACH FOR CONTENT-BASED RETRIEVAL OF 3D SHAPES
+Normal rank