Network sparsification with a variety of novel and known network sparsification techniques. All network sparsification techniques reduce the number of edges, not the number of nodes. Network sparsification is sometimes referred to as network dimensionality reduction. This package is based on the work of Spielman, D., Srivastava, N. (2009)<doi:10.48550/arXiv.0803.0929>. Koutis I., Levin, A., Peng, R. (2013)<doi:10.48550/arXiv.1209.5821>. Toivonen, H., Mahler, S., Zhou, F. (2010)<doi:10.1007>. Foti, N., Hughes, J., Rockmore, D. (2011)<doi:10.1371>.
Version: 0.0.1 Depends: R (≥ 3.4) Imports: igraph (≥ 1.3.1), sanic (≥ 0.0.1), Matrix (≥ 1.2-18), methods (≥ 4.0.2), stats (≥ 4.0.2), dplyr (≥ 1.0.9) Published: 2022-11-15 DOI: 10.32614/CRAN.package.simplifyNet Author: Andrew Kramer [aut], Alexander Mercier [aut, cre, trl], Shubhankar Tripathi [ctb], Tomlin Pulliam [ctb], John Drake [ctb] Maintainer: Alexander Mercier <amercier at g.harvard.edu> License: GPL (≥ 3) NeedsCompilation: no Language: en-US Materials: README CRAN checks: simplifyNet results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=simplifyNet 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