Distributed finite-time calculation of node eccentricities, graph radius and graph diameter

DOI10.1016/j.sysconle.2016.02.015zbMath1338.93031OpenAlexW2302804348MaRDI QIDQ286507

Gabriele Oliva, Roberto Setola, Christoforos N. Hadjicostis

Publication date: 20 May 2016

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2016.02.015

zbMATH Keywords

diametereccentricityradiusdistributed algorithms\(\max\)-consensus

Mathematics Subject Classification ID

Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)

Related Items (6)

Sparse and distributed Analytic Hierarchy Process ⋮ Distributed computation of exact average degree and network size in finite time under quantized communication ⋮ A distributed asynchronous method of multipliers for constrained nonconvex optimization ⋮ Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks ⋮ Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts ⋮ Performance and robustness of discrete and finite time average consensus algorithms

Cites Work

• Unnamed Item
• Distributed Algorithms for Network Diameter and Girth
• Distributed algorithms for finding centers and medians in networks
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Random Geometric Graphs
• Convergence Rates of Distributed Average Consensus With Stochastic Link Failures
• Average Consensus with Packet Drop Communication
• Distributed approximation algorithms for weighted shortest paths
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Distributed Finite-Time Average-Consensus With Limited Computational and Storage Capability

This page was built for publication: Distributed finite-time calculation of node eccentricities, graph radius and graph diameter