A layer-by-layer recursive algorithm computes the full-depth path homology of stratified digraphs, with large speedups over the general algorithm for deep feedforward networks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Recursive Computation of Path Homology for Stratified Digraphs
A layer-by-layer recursive algorithm computes the full-depth path homology of stratified digraphs, with large speedups over the general algorithm for deep feedforward networks.