A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS (Q5247063): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ray shooting in polygons using geodesic triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Certifying algorithms / rank | |||
Normal rank | |||
Latest revision as of 23:32, 9 July 2024
scientific article; zbMATH DE number 6429188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS |
scientific article; zbMATH DE number 6429188 |
Statements
A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS (English)
0 references
22 April 2015
0 references
sensor networks
0 references
barrier coverage
0 references
barrier resilience
0 references
ray sensors
0 references
