| | |
@article{DBLP:journals/ipl/Dublish88,
author = {Pratul Dublish},
title = {An O(n$^3$) Algorithm for Finding the Minimal Opaque Forest
of a Convex Polygon},
journal = {Inf. Process. Lett.},
volume = {29},
number = {5},
year = {1988},
pages = {275-276},
ee = {http://dx.doi.org/10.1016/0020-0190(88)90122-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-10 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page