The problems considered include: marking the bridges of an undirected graph, marking the articulation points of such a graph, finding the length of a shortest ...

The problems considered include: marking the bridges of an undirected graph, marking the articulation points of such a graph, finding the length of a shortest ...

In this paper we present techniques that result in time algorithms for computing many properties and functions of an n-node forest stored in an mesh of ...

In this paper we present techniques that result in 0 ('1';) time algorithms for computing many properties and functions of an n -node forest stored in an ,r ...

The problems considered include: marking the bridges of an undirected graph, marking the articulation points of such a graph, finding the length of a shortest ...

We present a self-repairing circuit for a mesh-connected processor array with faulty processing elements which are directly replaced by spare processing ...

Sep 12, 1996 · A connected-components algorithm can also be used to construct a minimum spanning tree or to nd a path between a pair of vertices. Meshes.

Bibliographic details on Graph Problems on a Mesh-Connected Processor Array.

The graph adjacency-list construction problem is to construct an adjacency-list representation of the graph, i.e., an array L[1..n] of linked lists, where L[i] ...

In this paper, we present a parallel algorithm for term matching of logical terms on a mesh-connected array of processors. Term matching is a special case.