Pages that link to "Item:Q3628102"

The following pages link to CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102):

Displaying 4 items.

• Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
• The searchlight problem for road networks (Q2354403) (← links)
• Optimum sweeps of simple polygons with two guards (Q2445401) (← links)
• Characterizing and recognizing LR-visibility polygons (Q2448917) (← links)