Pages that link to "Item:Q4858653"
From MaRDI portal
The following pages link to SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM (Q4858653):
Displaying 17 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)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- On the domination search number (Q1811076) (← links)
- Simple algorithms for searching a polygon with flashlights (Q1847385) (← links)
- Mobile sensor intrusion detection under any shape of curve (Q2450539) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← links)
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537) (← links)
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Q3502674) (← links)
- FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE (Q3562853) (← 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)
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT (Q4818547) (← links)
- SEARCHING A ROOM BY TWO GUARDS (Q4818565) (← links)
- Visibility-based pursuit-evasion in a polygonal environment (Q5096922) (← links)
