Computing Persistent Homology of Flag Complexes via Strong Collapses
Abstract
This paper is a continuation of the research reported in [7] on the usage of strong collapses to accelerate the computation of persistent homology (PH). We show that further decisive progress can be obtained if one restricts the family of simplicial complexes to flag complexes. The resulting method is simple and extremely efficient.
Origin : Files produced by the author(s)
Loading...