A Distributed Biconnectivity Check

DOI10.1007/4-431-35881-1_1zbMATH Open1173.91318OpenAlexW123593665MaRDI QIDQ3434848FDOQ3434848

Authors:

Publication date: 3 May 2007

Published in: Distributed Autonomous Robotic Systems 7 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/4-431-35881-1_1

Recommendations

• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Distributed motion constraints for algebraic connectivity of robotic networks
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Decentralized local-global connectivity maintenance for networked robotic teams
• Keeping Mobile Robot Swarms Connected

Mathematics Subject Classification ID

Signaling and communication in game theory (91A28) Automated systems (robots, etc.) in control theory (93C85)

Cited In (1)

• Distributed Tree Rearrangements for Reachability and Robust Connectivity

This page was built for publication: A Distributed Biconnectivity Check

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