An efficient algorithm for 1-dimensional (Persistent) path homology
DOI10.1007/S00454-022-00430-8OpenAlexW3001347149MaRDI QIDQ2105324FDOQ2105324
Authors: Tianqi Li, Yusu Wang, Tamal K. Dey 
Publication date: 8 December 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.09549
Recommendations
- An efficient algorithm for 1-dimensional (persistent) path homology
- An output-sensitive algorithm for persistent homology
- An output-sensitive algorithm for persistent homology
- Coreduction homology algorithm for inclusions and persistent homology
- Persistent homology computation using combinatorial map simplification
- Efficient algorithms for computing a minimal homology basis
- Efficient Computation of Persistent Homology for Cubical Data
- Efficient and robust persistent homology for measures
- Efficient and robust persistent homology for measures
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Relations of low-dimensional topology with graph theory (57M15) Methods of algebraic topology in functional analysis (cohomology, sheaf and bundle theory, etc.) (46M20)
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Arboricity and Subgraph Listing Algorithms
- Fast matrix rank algorithms and applications
- Greedy optimal homotopy and homology generators
- A greedy approach to compute a minimum cycle basis of a directed graph
- Cohomology of digraphs and (undirected) graphs
- A functorial Dowker theorem and persistent homology of asymmetric networks
- Persistent path homology of directed networks
- Annotating simplices with a homology basis and its applications
- Efficient algorithms for computing a minimal homology basis
Cited In (6)
- An efficient algorithm for 1-dimensional (persistent) path homology
- An efficient algorithm for $1$-dimensional (persistent) path homology
- Persistent path Laplacian
- First Betti number of the path homology of random directed graphs
- Hochschild homology, and a persistent approach via connectivity digraphs
- Distances and isomorphism between networks: stability and convergence of network invariants
This page was built for publication: An efficient algorithm for 1-dimensional (Persistent) path homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105324)
