Searching a Solid Pseudo 3-Sided Orthoconvex Grid

Symvonis, A; Tragoudas, S

dc.contributor.author	Symvonis, A	en
dc.contributor.author	Tragoudas, S	en
dc.date.accessioned	2014-03-01T02:48:06Z
dc.date.available	2014-03-01T02:48:06Z
dc.date.issued	1992	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33538
dc.subject	Optimal Algorithm	en
dc.title	Searching a Solid Pseudo 3-Sided Orthoconvex Grid	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-56279-6_72	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-56279-6_72	en
heal.publicationDate	1992	en
heal.abstract	. In this paper we examine the edge searching problem onpseudo 3-sided solid orthoconvex grids. We obtain a closed formula thatexpresses the minimum number of searchers required to search a pseudo3-sided solid orthoconvex grid. From that formula and a rather straightforward algorithm we show that the problem is in P. We obtain a parallelversion of that algorithm that places the	en
heal.journalName	International Symposium on Algorithms and Computation	en
dc.identifier.doi	10.1007/3-540-56279-6_72	en