Bounding the Cover Time in Edge-Uniform Stochastic Graphs.
Ioannis LamprouRussell MartinPaul G. SpirakisPublished in: CoRR (2017)
Keyphrases
- weighted graph
- undirected graph
- stochastic optimization
- upper bound
- edge detection
- edge information
- minimum spanning trees
- graph matching
- graph theoretic
- graph representation
- image segmentation
- series parallel
- graph theory
- edge weights
- markov chain
- graph partitioning
- edge detector
- graph model
- directed graph
- monte carlo
- objective function
- bipartite graph
- adjacency graph
- stochastic nature
- approximation algorithms