An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs.
Shang ShangPaul W. CuffPan HuiSanjeev R. KulkarniPublished in: CoRR (2014)
Keyphrases
- upper bound
- lower bound
- dynamic graph
- worst case
- branch and bound algorithm
- graph matching
- lower and upper bounds
- convergence speed
- convergence rate
- graph mining
- graph theoretic
- branch and bound
- generalization error
- constant factor
- directed graph
- graph databases
- graph theory
- random graphs
- dct coefficients
- graph structure
- iterative algorithms
- relational structures
- neural network
- computational complexity
- data sets
- social networks
- optimal solution
- search algorithm
- np hard