Pages that link to "Item:Q2583537"
From MaRDI portal
The following pages link to Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537):
Displayed 7 items.
- Studying the stochastic capturing of moving intruders by mobile sensors (Q356177) (← links)
- Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Mobile sensor intrusion detection under any shape of curve (Q2450539) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159) (← links)
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER (Q4682196) (← links)