An efficient algorithm for 1-dimensional (Persistent) path homology

DOI10.1007/s00454-022-00430-8OpenAlexW3001347149MaRDI QIDQ2105324

Yusu Wang, Tianqi Li, Tamal Krishna 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

zbMATH Keywords

directed grapharboricitycomputational topologytopological persistencepath homology

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Methods of algebraic topology in functional analysis (cohomology, sheaf and bundle theory, etc.) (46M20) Relations of low-dimensional topology with graph theory (57M15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Persistent path Laplacian ⋮ Distances and isomorphism between networks: stability and convergence of network invariants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cohomology of digraphs and (undirected) graphs
• A greedy approach to compute a minimum cycle basis of a directed graph
• Efficient algorithms for computing a minimal homology basis
• A functorial Dowker theorem and persistent homology of asymmetric networks
• Annotating Simplices with a Homology Basis and Its Applications
• Arboricity and Subgraph Listing Algorithms
• Persistent Path Homology of Directed Networks
• Fast matrix rank algorithms and applications

This page was built for publication: An efficient algorithm for 1-dimensional (Persistent) path homology