On the Complexity of Sampling Nodes Uniformly from a Graph.
Flavio ChierichettiShahrzad HaddadanPublished in: CoRR (2017)
Keyphrases
- directed graph
- graph structure
- weighted graph
- undirected graph
- adjacency matrix
- graph structures
- spanning tree
- graph representation
- random sampling
- space complexity
- root node
- shortest path
- edge weights
- graph theory
- graph matching
- directed edges
- finding the shortest path
- worst case
- attributed graphs
- random graphs
- causal graph
- polynomial time complexity
- nodes of a graph
- computational complexity
- fully connected
- graph clustering
- minimum cost
- graph model
- graph mining
- monte carlo
- lower bound