9 citations · 11 across the 2 of their papers we have counts for
2 papers
math.OC2013★ 9 cited
On the convergence of weighted-average consensus
Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa +1
In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of t…
cs.DM2012★ 2 cited
L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm
Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa +1
In this paper we consider undirected graphs with no loops and multiple edges, consisting of k connected components. In these cases, it is well known that one can find a numbering o…