An algorithm for finding Hamilton paths and cycles in random graphs
Combinatorica - Theory of Computing
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
On a random walk problem arising in self-stabilizing token management
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Dynamic load balancing by random matchings
Journal of Computer and System Sciences
Optimal dimension-exchange token distribution on complete binary trees
Theoretical Computer Science
Meeting times of random walks on graphs
Information Processing Letters
Tight Analyses of Two Local Load Balancing Algorithms
SIAM Journal on Computing
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Strongly Adaptive Token Distribution
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Dimension-exchange algorithms for token distribution on tree-connected architectures
Journal of Parallel and Distributed Computing
Automatica (Journal of IFAC)
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
Distributed Average Consensus using Probabilistic Quantization
SSP '07 Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing
A token-ring network for local data communications
IBM Systems Journal
Gossip consensus algorithms via quantized communication
Automatica (Journal of IFAC)
On quantized consensus by means of gossip algorithm: part i: convergence proof
ACC'09 Proceedings of the 2009 conference on American Control Conference
On quantized consensus by means of gossip algorithm: part ii: convergence time
ACC'09 Proceedings of the 2009 conference on American Control Conference
A distributed algorithm to find hamiltonian cycles in g(np) random graphs
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Distributed Average Consensus With Dithered Quantization
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Information Theory
| Hi-index | 22.14 |
The main contribution of this paper is an algorithm to solve an extended version of the quantized consensus problem over networks represented by Hamiltonian graphs, i.e., graphs containing a Hamiltonian cycle, which we assume to be known in advance. Given a network of agents, we assume that a certain number of tokens should be assigned to the agents, so that the total number of tokens weighted by their sizes is the same for all the agents. The algorithm is proved to converge almost surely to a finite set containing the optimal solution. A worst case study of the expected convergence time is carried out, thus proving the efficiency of the algorithm with respect to other solutions recently presented in the literature. Moreover, the algorithm has a decentralized stop criterion once the convergence set is reached.