On the barrier graph of an arrangement of ray sensors

DOI10.1016/J.DAM.2017.03.002MaRDI QIDQ528551zbMATH OpenOpenAlexFDO

Authors Kirk Boyer, Mario A. Lopez, Paul Horn

Publication date 12 May 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2017.03.002

zbMATH Keywords

wireless sensor networkbarrier graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Barrier coverage
• A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
• Distributed barrier coverage with relocatable sensors
• New Algorithms for Barrier Coverage with Mobile Sensors

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
• Continuous surveillance of points by rotating floodlights
• Geometric algorithms and combinatorial optimization
• Recognizing Berge graphs
• Reducibility among combinatorial problems
• The enumeration of bipartite graphs
• The strong perfect graph theorem

Cited in

(1)

• Extremal problems on ray sensor configurations

This page was built for publication: On the barrier graph of an arrangement of ray sensors

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