4 research outputs found

    Searching a Pseudo 3-Sided Solid Orthoconvex Grid

    No full text
    In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvex grids. We define a similar problem which we call modified edge searching, and we derive a relation among the original edge searching problem and the modified one. Then, for the modified edge searching problem, we show that there are searching strategies that possess several properties regarding the way the grid is searched. These strategies allow us to obtain a closed formula that expresses the minimum number of searchers required to search a pseudo 3-sided solid orthoconvex grid. From that formula and a rather straight forward algorithm we can show that the problem is in P. We obtain a parallel version of that algorithm that places the problem in NC. For the case of sequential algorithms, we derive an optimal algorithm that solves the problem in O(m) time where m is the number of points necessary to describe the orthoconvex grid. Another important feature of our method is that it also suggests an ..

    Searching a Solid Pseudo 3-Sided Orthoconvex Grid

    No full text

    Searching a Solid Pseudo 3-Sided Orthoconvex Grid

    No full text
    . In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvex grids. We obtain a closed formula that expresses the minimum number of searchers required to search a pseudo 3-sided solid orthoconvex grid. From that formula and a rather straight forward algorithm we show that the problem is in P. We obtain a parallel version of that algorithm that places the problem in NC. For the case of sequential algorithms, we derive an optimal algorithm that solves the problem in O(m) time where m is the number of points necessary to describe the orthoconvex grid. Another important feature of our method is that it also suggests an optimal searching strategy that consists of O(n) steps, where n is the number of nodes of the grid. 1 Introduction The edge-searching problem was introduced by Parson in [7]. An undirected graph was given and the objective was to clean its contaminated edges (or, in a different statement of the problem, to capture a fugitive hidden in them). Thr..

    SEARCHING A PSEUDO 3-SIDED SOLID ORTHOCONVEX GRID

    No full text
    corecore