On the Complexity of Sampling Vertices Uniformly from a Graph.
Flavio ChierichettiShahrzad HaddadanPublished in: ICALP (2018)
Keyphrases
- weighted graph
- labeled graphs
- adjacency matrix
- undirected graph
- vertex set
- random graphs
- graph model
- random walk
- average degree
- hamiltonian cycle
- planar graphs
- minimum weight
- edge weights
- graph representation
- directed graph
- graph theoretic
- directed edges
- maximum matching
- worst case
- bipartite graph
- causal graph
- minimum spanning tree
- graph theory
- graph structure
- attributed graphs
- sparse sampling
- decision problems
- monte carlo
- structured data
- random sampling
- connected graphs
- graph partitioning