On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace.
Dean DoronAmnon Ta-ShmaPublished in: ICALP (1) (2015)
Keyphrases
- undirected graph
- directed graph
- directed acyclic graph
- probabilistic model
- approximation algorithms
- minimum cost
- graph structure
- spanning tree
- connected components
- bayesian networks
- covariance matrix
- generative model
- random graphs
- positive integer
- complex networks
- disjoint paths
- multicommodity flow
- graphical models
- average degree