Pages that link to "Item:Q4682159"
From MaRDI portal
The following pages link to SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159):
Displayed 6 items.
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- Sweeping simple polygons with the minimum number of chain guards (Q845964) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← links)
- Hide-and-Seek: Algorithms for Polygon Walk Problems (Q3010428) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)