Distributed graph augmentation protocols to achieve strong connectivity in multi-agent networks

DOI10.1016/J.AUTOMATICA.2025.112539MaRDI QIDQ6929918zbMATH OpenFDO

Authors Guilherme Ramos, Diogo Poças, Sérgio Pequito

Publication date 16 September 2025

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2025.112539

zbMATH Keywords

distributed algorithmsgraph augmentationmulti-agent systemsstrongly connected digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Multi-agent systems (93A16)

Cites work

• A Scalable Distributed Dynamical Systems Approach to Learn the Strongly Connected Components and Diameter of Networks
• A survey on distributed estimation and control applications using linear consensus algorithms
• An 0(log n) parallel algorithm for strong connectivity augmentation problem
• Approximation Algorithms for Several Graph Augmentation Problems
• Augmentation Problems
• Connectivity and aggregation in multihop wireless networks
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Depth-First Search and Linear Graph Algorithms
• Designing communication networks for discrete-time consensus for performance and privacy guarantees
• Deterministic broadcasting in ad hoc radio networks
• Fast parallel graph searching with applications
• General resilient consensus algorithms
• Graph theoretic methods in multiagent networks
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• Smallest Augmentations to Biconnect a Graph

This page was built for publication: Distributed graph augmentation protocols to achieve strong connectivity in multi-agent networks

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