Graph reconstruction by discrete Morse theory
From MaRDI portal
Publication:5115799
Recommendations
Cites work
- Computational topology. An introduction
- Graph reconstruction by discrete Morse theory
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Locally defined principal curves and surfaces
- Metric graph reconstruction from noisy data
- Morse Theory. (AM-51)
- Morse theory for cell complexes
- Optimal topological simplification of discrete functions on surfaces
- Principal Curves
- Reeb graphs for shape analysis and applications
- Topological persistence and simplification
Cited in
(10)- Reconstructing a graph from the boundary distance matrix
- Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
- A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
- Minimum monotone tree decomposition of density functions defined on graphs
- Parameterized inapproximability of Morse matching
- Metric graph reconstruction from noisy data
- Vietoris-Rips complexes of metric spaces near a metric graph
- Reconstructing embedded graphs from persistence diagrams
- Statistical analysis of metric graph reconstruction
- Graph reconstruction by discrete Morse theory
This page was built for publication: Graph reconstruction by discrete Morse theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115799)