The Contiguous Art Gallery Problem is Solvable in Polynomial Time

Bibliográfalaš dieđut

Publikašuvnnas:	arXiv.org (Dec 18, 2024), p. n/a
Váldodahkki:	Magnus Christian Ring Merrild
Eará dahkkit:	Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Svenning, Rolf
Almmustuhtton:	Cornell University Library, arXiv.org
Fáttát:	Apexes Algorithms Polygons Computational geometry Polynomials Art galleries & museums Greedy algorithms Run time (computers)
Liŋkkat:	Citation/Abstract Full text outside of ProQuest
Fáddágilkorat:	Lasit fáddágilkoriid Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!