Pages that link to "Item:Q845964"
From MaRDI portal
The following pages link to Sweeping simple polygons with the minimum number of chain guards (Q845964):
Displaying 6 items.
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- Optimum sweeps of simple polygons with two guards (Q2445401) (← 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)
