Searching a Pseudo 3-Sided Solid Orthoconvex Grid

Symvonis, A; Tragoudas, S

dc.contributor.author	Symvonis, A	en
dc.contributor.author	Tragoudas, S	en
dc.date.accessioned	2014-03-01T01:41:44Z
dc.date.available	2014-03-01T01:41:44Z
dc.date.issued	1993	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/23609
dc.title	Searching a Pseudo 3-Sided Solid Orthoconvex Grid	en
heal.type	journalArticle	en
heal.publicationDate	1993	en
heal.abstract	In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvexgrids. We define a similar problem which we call modified edge searching,and we derive a relation among the original edge searching problem and the modifiedone. Then, for the modified edge searching problem, we show that there are searchingstrategies that possess several properties regarding the way the grid	en
heal.journalName	International Journal of Foundations of Computer Science	en