Surrounding Nodes in Coordinate-Free Networks

DOI10.1007/978-3-540-68405-3_26zbMath1194.93145OpenAlexW1484651275MaRDI QIDQ3564328

Sameera Poduri, Gaurav S. Sukhatme, David Lipsky, Robert W. Ghrist

Publication date: 2 June 2010

Published in: Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68405-3_26

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unit disk graph recognition is NP-hard
• Coverage in sensor networks via persistent homology
• Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
• Deterministic boundary recognition and topology extraction for large sensor networks

This page was built for publication: Surrounding Nodes in Coordinate-Free Networks