An efficient algorithm for 1-dimensional (Persistent) path homology (Q2105324)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for 1-dimensional (Persistent) path homology |
scientific article; zbMATH DE number 7628957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for 1-dimensional (Persistent) path homology |
scientific article; zbMATH DE number 7628957 |
Statements
An efficient algorithm for 1-dimensional (Persistent) path homology (English)
0 references
8 December 2022
0 references
computational topology
0 references
path homology
0 references
directed graph
0 references
topological persistence
0 references
arboricity
0 references
0.88385236
0 references
0.88385236
0 references
0.8767139
0 references
0.87311465
0 references
0.87057126
0 references
0.86702335
0 references
0.86529565
0 references
0.86529565
0 references
