Graph reconstruction by discrete Morse theory
From MaRDI portal
Publication:5115799
DOI10.4230/LIPICS.SOCG.2018.31zbMATH Open1494.55009arXiv1803.05093MaRDI QIDQ5115799FDOQ5115799
Jiayuan Wang, Tamal K. Dey, Yusu Wang
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1803.05093
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Persistent homology and applications, topological data analysis (55N31) Computational aspects of digital topology (68U03)
Cites Work
- Computational topology. An introduction
- Principal Curves
- Title not available (Why is that?)
- Morse theory for cell complexes
- Topological persistence and simplification
- Morse Theory. (AM-51)
- Optimal topological simplification of discrete functions on surfaces
- Reeb graphs for shape analysis and applications
- Metric graph reconstruction from noisy data
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Title not available (Why is that?)
Cited In (6)
- 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
- Title not available (Why is that?)
- Vietoris-Rips complexes of metric spaces near a metric graph
- Reconstructing embedded graphs from persistence diagrams
Uses Software
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)