Graph Problems on a Mesh-Connected Processor Array

On donne des algorithmes fonctionnant par etapes de O(n) pour resoudre un certain nombre de problemes de graphes sur un reseau n×n de processeurs. Le probleme considere comprend: la recherche des ponts et points d'articulation d'un graphe non oriente, la recherche de la longueur du cycle le plus court, la recherche d'un arbre maximal, minimal et d'autres problemes

[1]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[2]  Karl N. Levitt,et al.  Cellular arrays for the solution of graph problems , 1972, Commun. ACM.

[3]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[4]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[5]  Frances L. Van Scoy.  The Parallel Recognition of Classes of Graphs , 1980, IEEE Trans. Computers.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Lynn Elliot Cannon,et al.  A cellular computer to implement the kalman filter algorithm , 1969 .

[8]  Susanne E. Hambrusch.  VLSI Algorithms for the Connected Component Problem , 1983, SIAM J. Comput..

[9]  S. Rao Kosaraju.  Speed of Recognition of Context-Free Languages by Array Automata , 1975, SIAM J. Comput..

[10]  Sambasiva Rao Kosaraju.  Computations on iterative automata , 1969 .

[11]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[12]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[13]  Mikhail J. Atallah.  Finding the Cyclic Index of an Irreducible, Nonnegative Matrix , 1982, SIAM J. Comput..

[14]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[15]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[16]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.