Pages that link to "Item:Q2445196"

The following pages link to Watchman routes for lines and line segments (Q2445196):

Displaying 4 items.

• An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
• Reachable region query and its applications (Q2201650) (← links)
• The searchlight problem for road networks (Q2354403) (← links)
• THE MINIMUM GUARDING TREE PROBLEM (Q5411806) (← links)