On the barrier graph of an arrangement of ray sensors

DOI10.1016/j.dam.2017.03.002zbMath1362.68227OpenAlexW2604913903MaRDI QIDQ528551

Kirk Boyer, Mario A. Lopez, Paul S. 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)

Related Items (1)

Extremal problems on ray sensor configurations

Cites Work

• Unnamed Item
• The enumeration of bipartite graphs
• The strong perfect graph theorem
• Geometric algorithms and combinatorial optimization
• Recognizing Berge graphs
• Reducibility among Combinatorial Problems
• CONTINUOUS SURVEILLANCE OF POINTS BY ROTATING FLOODLIGHTS
• A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS

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