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

DOI10.4230/LIPICS.SOCG.2020.36MaRDI QIDQ6059985zbMATH OpenFDO

Authors Tamal K. Dey, Tianqi Li, Yusu Wang

Publication date 2 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2020.36

zbMATH Keywords

computational topologydirected graphpath homologypersistent path homology

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An efficient algorithm for 1-dimensional (Persistent) path homology
• Persistent path homology of directed networks
• Persistent homology over directed acyclic graphs
• A directed persistent homology theory for dissimilarity functions
• Path homology of directed hypergraphs

Cited in

(4)

• An efficient algorithm for 1-dimensional (Persistent) path homology
• Persistent path Laplacian
• First Betti number of the path homology of random directed graphs
• Grounded persistent path homology: a stable, topological descriptor for weighted digraphs

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 Q6059985)