Pages that link to "Item:Q1114398"
From MaRDI portal
The following pages link to An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon (Q1114398):
Displaying 6 items.
- Improving the lower bound on opaque sets for equilateral triangle (Q313808) (← links)
- Opaque sets (Q517796) (← links)
- A counterexample to the algorithms for determining opaque minimal forests (Q1183430) (← links)
- Optimization of a subclass of conjunctive queries (Q1346219) (← links)
- Opaque Sets (Q3088094) (← links)
- Computing Opaque Interior Barriers à la Shermer (Q5502099) (← links)
