Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
DOI10.1016/J.SYSCONLE.2016.02.015zbMATH Open1338.93031OpenAlexW2302804348MaRDI QIDQ286507FDOQ286507
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
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
Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Random Geometric Graphs
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Title not available (Why is that?)
- Distributed algorithms for network diameter and girth
- Distributed approximation algorithms for weighted shortest paths
- Distributed algorithms for finding centers and medians in networks
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- Convergence Rates of Distributed Average Consensus With Stochastic Link Failures
- Average Consensus with Packet Drop Communication
- Distributed Finite-Time Average-Consensus With Limited Computational and Storage Capability
Cited In (6)
- A distributed asynchronous method of multipliers for constrained nonconvex optimization
- Distributed computation of exact average degree and network size in finite time under quantized communication
- Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
- Performance and robustness of discrete and finite time average consensus algorithms
- Sparse and distributed Analytic Hierarchy Process
- Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts
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)
