Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Computing Persistent Homology of Flag Complexes via Strong Collapses

Jean-Daniel Boissonnat 1, 2 Siddharth Pritam 2 
2 DATASHAPE - Understanding the Shape of Data
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
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.
Complete list of metadata

Cited literature [56 references]  Display  Hide  Download
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Monday, December 10, 2018 - 3:31:47 PM
Last modification on : Friday, February 4, 2022 - 3:09:54 AM
Long-term archiving on: : Monday, March 11, 2019 - 2:52:14 PM


Files produced by the author(s)


  • HAL Id : hal-01950074, version 1


Jean-Daniel Boissonnat, Siddharth Pritam. Computing Persistent Homology of Flag Complexes via Strong Collapses. {date}. ⟨hal-01950074⟩



Record views


Files downloads