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

DOI10.1016/J.SYSCONLE.2016.02.015MaRDI QIDQ286507zbMATH OpenOpenAlexFDO

Authors 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

diameterdistributed algorithmseccentricityradius\(\max\)-consensus

Mathematics Subject Classification ID

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

Recommendations

• Computing the eccentricity distribution of large graphs
• Distributed algorithms for network diameter and girth
• On computing the diameter of real-world undirected graphs
• Computation of diameter, radius and center of permutation graphs
• A distributed algorithm for constructing a minimum diameter spanning tree

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Average Consensus with Packet Drop Communication
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Convergence Rates of Distributed Average Consensus With Stochastic Link Failures
• Distributed Finite-Time Average-Consensus With Limited Computational and Storage Capability
• Distributed algorithms for finding centers and medians in networks
• Distributed algorithms for network diameter and girth
• Distributed approximation algorithms for weighted shortest paths
• Random Geometric Graphs

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286507)