CONTEST

swMATH12738MaRDI QIDQ24664FDOQ24664

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=1462175

Cited In (33)

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

This page was built for software: CONTEST