A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
From MaRDI portal
Publication:5405891
Graph algorithms (graph-theoretic aspects) (05C85) Simplicial sets and complexes in algebraic topology (55U10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)
Recommendations
- A deterministic O(m m) time algorithm for the Reeb graph
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- Efficient algorithms for computing Reeb graphs
- Note on an algorithm for computing the Reeb graph
- Reeb graphs: approximation and persistence
- Reeb graphs, approximation and persistence
- scientific article; zbMATH DE number 1263228
- Algorithms and complexity results for finding graphs with extremal Randić index
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Cited in
(23)- Structure and stability of the one-dimensional Mapper
- Avoiding the global sort: a faster contour tree algorithm
- Reeb graphs: approximation and persistence
- Generalized persistence diagrams for persistence modules over posets
- Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- Robust computations of Reeb graphs in 2-D binary images
- A deterministic O(m m) time algorithm for the Reeb graph
- Enhanced topology-sensitive clustering by Reeb graph shattering
- Categorified Reeb graphs
- Efficient Output-Sensitive Construction of Reeb Graphs
- The JS-graphs of join and split trees (extended abstract)
- Maintaining Reeb graphs of triangulated 2-manifolds
- Time-varying Reeb graphs for continuous space-time data
- Reeb graphs, approximation and persistence
- Constructing Reeb graphs using cylinder maps
- Realizable piecewise linear paths of persistence diagrams with Reeb graphs
- Drawing Reeb graphs
- An algorithm for fast and correct computation of Reeb spaces for PL bivariate fields
- Reeb lobsters are 1-planar (poster abstract)
- Efficient algorithms for computing Reeb graphs
- Time-varying Reeb graphs for continuous space-time data
This page was built for publication: A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405891)
