Computing Persistent Homology of Flag Complexes via Strong Collapses - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2018

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.
Fichier principal
Vignette du fichier
boissonnat-pritam.pdf (507.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01950074 , version 1 (10-12-2018)

Identifiers

  • HAL Id : hal-01950074 , version 1

Cite

Jean-Daniel Boissonnat, Siddharth Pritam. Computing Persistent Homology of Flag Complexes via Strong Collapses. 2018. ⟨hal-01950074⟩
140 View
475 Download

Share

Gmail Facebook X LinkedIn More