CONTEST
From MaRDI portal
Cited in
(33)- Matrix Depot
- anymatrix
- On the exponential generating function for non-backtracking walks
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
- Computing the reciprocal of a -function by rational approximation
- Aitken's method for estimating bilinear forms arising in applications
- Chebyshev acceleration of the GeneRank algorithm
- Algorithm 694
- Hadamard
- testmatrix
- Anymatrix: an extensible MATLAB matrix collection
- Network analysis via partial spectral factorization and Gauss quadrature
- DOTmark
- Aggressively truncated Taylor series method for accurate computation of exponentials of essentially nonnegative matrices
- The University of Florida sparse matrix collection
- Network properties revealed through matrix functions
- Models for evolving networks: with applications in telecommunication and online activities
- NLEVP, a collection of nonlinear eigenvalue problems
- YM11
- Temporal_Eigenvector_Centrality
- A network model for polarization of political opinion
- Preconditioning linear least-squares problems by identifying a basis matrix
- Updating and downdating techniques for optimizing network communicability
- MMQ Toolbox
- GeneRank
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- The deformed graph Laplacian and its applications to network centrality analysis
- Approximation of functions of large matrices with Kronecker structure
- Block matrix formulations for evolving networks
- sgcen
- A new lower bound on the size of the smallest vertex separator of a graph
- NESSIE
- Quadrature rule-based bounds for functions of adjacency matrices
This page was built for software: CONTEST
