Pages that link to "Item:Q4682196"
From MaRDI portal
The following pages link to SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER (Q4682196):
Displayed 8 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)
- On the domination search number (Q1811076) (← links)
- Simple algorithms for searching a polygon with flashlights (Q1847385) (← links)
- Minimization of the maximum distance between the two guards patrolling a polygonal region (Q2445875) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← links)
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Q3502674) (← links)
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159) (← links)