persistence: Optimal Graph Partition using the Persistence
Calculate the optimal vertex partition of a graph using the persistence as objective function.
  These subroutines have been used in Avellone et al. <doi:10.1007/s10288-023-00559-z>.
| Version: | 0.2.0 | 
| Suggests: | igraph | 
| Published: | 2025-10-06 | 
| DOI: | 10.32614/CRAN.package.persistence | 
| Author: | Alessandro Avellone [aut, cre],
  Paolo Bartesaghi [aut],
  Stefano Benati [aut],
  Rosanna Grassi [aut] | 
| Maintainer: | Alessandro Avellone  <alessandro.avellone at unimib.it> | 
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] | 
| NeedsCompilation: | yes | 
| SystemRequirements: | C++20 | 
| CRAN checks: | persistence results | 
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=persistence
to link to this page.