S-Core Graph Decomposition algorithm for graphs. This is a method for decomposition of a weighted graph, as proposed by Eidsaa and Almaas (2013) <doi:10.1103/PhysRevE.88.062819>. The high speed and the low memory usage make it suitable for large graphs.
Version: 0.1.2 Imports: Rcpp (≥ 1.0.12), Rfast, igraph LinkingTo: Rcpp Suggests: Rfast2, knitr, rmarkdown, testthat (≥ 3.0.0) Published: 2024-11-20 DOI: 10.32614/CRAN.package.scoredec Author: Christos Adam [aut, cre] Maintainer: Christos Adam <econp266 at econ.soc.uoc.gr> BugReports: https://github.com/cadam00/scoredec/issues License: GPL-3 URL: https://github.com/cadam00/scoredec, https://cadam00.github.io/scoredec/ NeedsCompilation: yes Materials: README NEWS CRAN checks: scoredec results Documentation: Reference manual: scoredec.pdf Vignettes: Introduction to scoredec (source, R code)Please use the canonical form https://CRAN.R-project.org/package=scoredec to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4