Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds.
Rosario AraguesGuodong ShiDimos V. DimarogonasCarlos SagüésKarl Henrik JohanssonYoucef MezouarPublished in: Autom. (2014)
Keyphrases
- upper and lower bounds
- undirected graph
- upper bound
- connected components
- directed graph
- strongly connected
- lower bound
- approximation algorithms
- directed acyclic graph
- lower and upper bounds
- sample complexity
- graph structure
- disjoint paths
- spanning tree
- complex networks
- parameter estimation
- optimal solution
- reinforcement learning
- decision trees