Old Web
English
Sign In
Acemap
>
Paper
>
A lower bound for distributed averaging algorithms on the line graph
A lower bound for distributed averaging algorithms on the line graph
2010
Olshevsky
Tsitsiklis
Keywords:
Line graph
Mathematics
Algorithm design
Markov process
Convergence (routing)
Discrete mathematics
Upper and lower bounds
Correction
Source
Cite
Save
Machine Reading By IdeaReader
18
References
2
Citations
NaN
KQI
[]