Algorithms that run in O(n) steps are given for solving a number of graph problems on an n x n array of processors. The problems considered include: finding the bridges and artiedation points of an undirected graph, findmg the length of a shortest cycle, finding a minimum spanning tree, and a number of other problems.
No takes yet. Share an insight, caveat, or question.
Atallah et al. (1984) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: