Successive approximation in parallel graph algorithms

Extended abstract
  • Donald Fussell
  • Ramakrishna Thurimella
Contributed Papers Parallel Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)


The notion of successive approximation is introduced in the context of parallel graph algorithms. The implementation of graph algorithms on Leighton's mesh of trees network model is considered. The implementations that have appeared so far in the literature are relatively straightforward. A common characteristic of these algorithms is that, in each iteration, for each vertex v, at most one edge is selected from the edges incident on v. This selection is based purely on local information such as the weights of the edges incident v or the labels of the neighboring vertices of v etc. As this sort of information appears on the same row of a mesh, these algorithms lend themselves to a direct implementation. In this paper we present an implementation of the open ear decomposition algorithm of Maon, Schieber and Vishkin. Some applications of open ear decomposition include parallel planarity testing, triconnectivity and 4-connectivity testing. This algorithm is different from the other algorithms considered for implementation on a mesh of trees in that a direct implementation is ruled out due to the communication problems posed by the network. Our implementation uses a technique of successive approximation. The process starts by finding an open ear decomposition of a subgraph of at most 2n edges: the edges of two edge-disjoint forests of G. Each subsequent iteration uses the decomposition from the previous step to obtain an open ear decomposition of an enlarged subgraph. This enlarged subgraph consists of the edges that received an ear label in the previous step together with at least as many new ones. Therefore the process converges in O(log n) iterations. The decomposition algorithm for each iteraction can be distributed on the network. The whole algorithm takes O(log3 n) time using O(n/log n × n/log n) processors. Assuming adjacency matrix representation of the graph, the achieved speedup is O(log n) factor off the optimal, which is the best known.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Fussell and R. Thurimella, “Separation Pair Detection,” VLSI Algorithms and Architectures, LNCS 319 (1988) pp. 149–159.Google Scholar
  2. [2]
    D. S. Hirschberg and D. Volper, “A Parallel Solution for the Minimum Spanning Tree Problem,” Proc. 1983 Johns Hopkins Conf. on Information science and systems (1983) pp. 680–684.Google Scholar
  3. [3]
    M. A. Huang, “Solving Some Graph Problems with Optimal or Near Optimal Speedup on Mesh-of-trees Networks,” Proc. 26th Annual IEEE Symp. on Foundations of Comp. Sci. (1985) pp. 232–240.Google Scholar
  4. [4]
    A. Kanevsky and V. Ramachandran, “Improved Algorithms for Four-connectivity,” Proc. 28th Annual IEEE Symp. on Foundations of Comp. Sci. (1987) pp. 252–259.Google Scholar
  5. [5]
    P.N. Klein and J.H. Reif, “An Efficient Parallel Algorithm for Planarity,” Proc. 27th Annual IEEE Symp. on foundations of Comp. Sci. (1986) pp. 465–477.Google Scholar
  6. [6]
    T. Leighton, Complexity Issues in VLSI, Cambridge, Massachusetts, MIT Press, 1983, ch.6.1.Google Scholar
  7. [7]
    T. Leighton, “Parallel Computation using Meshes of trees,” Proc. 1983 Int. Workshop on Graph-Theoretic Concepts in Computer Science (1983).Google Scholar
  8. [8]
    L. Lovasz, “Computing Ears and Branching in Parallel,” 26th annual IEEE Symp. on Foundations of Comp. Sci. (1985) pp. 464–467.Google Scholar
  9. [9]
    Y. Maon, B. Schieber and U. Vishkin, “Parallel Ear Decomposition Search (EDS) and ST-numbering in Graphs,” Theoretical Computer Science, 47 (1986) pp. 277–298.Google Scholar
  10. [10]
    G.L. Miller and V. Ramachandran, “Efficient Ear Decomposition with Applications,” Manuscript, MSRI, Berkeley, CA, Jan. 1986.Google Scholar
  11. [11]
    G.L. Miller and V. Ramachandran, “A New Triconnectivity Algorithm and Its Parallelization,” Proc. 19th Annual Symp. on Theory of Computing (1987) pp. 335–344.Google Scholar
  12. [12]
    Y. Shiloach and U. Vishkin, “An O(log n) Parallel Connectivity Algorithm,” J. Algorithms 2 (1981) pp. 57–63.Google Scholar
  13. [13]
    R. E. Tarjan and U. Vishkin, “An Efficient Parallel Biconnectivity Algorithm,” SIAM J. Computing 14 (1984) pp. 862–874.Google Scholar
  14. [14]
    H. Whitney, “Non-separable and planar graphs,” Trans. Amer. Math. Soc. 34 (1932) pp. 339–362.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Donald Fussell
    • 1
  • Ramakrishna Thurimella
    • 1
  1. 1.Department of Computer SciencesThe University of Texas at AustinAustin

Personalised recommendations