Convergence time evaluation of a gossip algorithm over signed graphs.
Thi Hoai Linh NguyenTakayuki WadaIzumi MasubuchiToru AsaiYasumasa FujisakiPublished in: ASCC (2015)
Keyphrases
- experimental evaluation
- detection algorithm
- iterative algorithms
- convergence rate
- objective function
- optimal solution
- preprocessing
- k means
- np hard
- matching algorithm
- high accuracy
- simulated annealing
- convergence property
- random graphs
- times faster
- worst case
- computational cost
- cost function
- significant improvement
- linear programming
- optimization algorithm
- neural network
- probabilistic model
- graph model
- dynamic programming
- graph construction
- convergence proof
- maximum common subgraph