A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node.
Uduak Inyang-UdohMichael ShanksNeera JainPublished in: CoRR (2022)
Keyphrases
- weighted graph
- strongly connected
- directed graph
- graph structure
- edge weights
- undirected graph
- adjacency matrix
- shortest path
- optimum path forest
- spanning tree
- graph model
- graph partitioning
- random walk
- minimum spanning tree
- maximum weight
- approximation algorithms
- normalized cut
- graph clustering
- minimum weight
- vertex set
- multimedia
- upper bound
- dynamic programming
- similarity measure