On the barrier graph of an arrangement of ray sensors

DOI10.1016/J.DAM.2017.03.002zbMATH Open1362.68227OpenAlexW2604913903MaRDI QIDQ528551FDOQ528551

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

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

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)

Cites Work

• Reducibility among combinatorial problems
• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• The strong perfect graph theorem
• Recognizing Berge graphs
• The enumeration of bipartite graphs
• Continuous surveillance of points by rotating floodlights
• A polynomial-time algorithm for computing the resilience of arrangements of ray sensors

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)