AbstractLet I be a n × n binary image stored in a n × n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture
We present an algorithm for the k-vertex connectivity problem, which runs in O(km) time. The time co...
In this paper, we present optimal parallel algorithms for optical clustering on a mesh-connected com...
Given a black and white image, represented by an array of $\surd$ n x $\surd$ n binary valued pixel...
Let I be a n × n binary image stored in a n × n mesh of processors with one pixel per processor. Ima...
AbstractLet I be a n × n binary image stored in a n × n mesh of processors with one pixel per proces...
In this paper we consider a new form of connectivity in binary images, called k-width connectivity. ...
: Dehne presented an optimal algorithm to compute the contour of the maximal elements of n planar po...
On a mesh-connected computer, moving data across the mesh is the most time-consuming operation in ma...
The problem of finding the largest connected subgraph of a given undirected host graph, subject to c...
There has recently been an interest in the introduction of reconfigurable buses to existing parallel...
In this paper we present techniques that result in O(n) time algorithms for computing many propertie...
The problem of finding the largest connected subgraph of a given undirected host graph, subject to c...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
Consider a n×n binary image. Given a direction D, the parallel visibility problem consists of determ...
There has recently been an interest in the introduction of reconfigurable buses to existing parallel...
We present an algorithm for the k-vertex connectivity problem, which runs in O(km) time. The time co...
In this paper, we present optimal parallel algorithms for optical clustering on a mesh-connected com...
Given a black and white image, represented by an array of $\surd$ n x $\surd$ n binary valued pixel...
Let I be a n × n binary image stored in a n × n mesh of processors with one pixel per processor. Ima...
AbstractLet I be a n × n binary image stored in a n × n mesh of processors with one pixel per proces...
In this paper we consider a new form of connectivity in binary images, called k-width connectivity. ...
: Dehne presented an optimal algorithm to compute the contour of the maximal elements of n planar po...
On a mesh-connected computer, moving data across the mesh is the most time-consuming operation in ma...
The problem of finding the largest connected subgraph of a given undirected host graph, subject to c...
There has recently been an interest in the introduction of reconfigurable buses to existing parallel...
In this paper we present techniques that result in O(n) time algorithms for computing many propertie...
The problem of finding the largest connected subgraph of a given undirected host graph, subject to c...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
Consider a n×n binary image. Given a direction D, the parallel visibility problem consists of determ...
There has recently been an interest in the introduction of reconfigurable buses to existing parallel...
We present an algorithm for the k-vertex connectivity problem, which runs in O(km) time. The time co...
In this paper, we present optimal parallel algorithms for optical clustering on a mesh-connected com...
Given a black and white image, represented by an array of $\surd$ n x $\surd$ n binary valued pixel...
DOI
Add to ORKG