Extension of the parallel nested dissection algorithm to path algebra problems

  • Victor Pan
  • John Reif
Session 8 Parallel Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 241)


This paper extends the author's parallel nested dissection algorithm of [PR] originally devised for solving sparse linear systems. We present a class of new applications of the nested dissection method, this time to path algebra computations, (in both cases of single source and all pair paths), where the path algebra problem is defined by a symmetric matrix A whose associated graph G with n vertices is planar. We substantially improve the known algorithms for path algebra problems of that general class: {fx470-1}

(In case of parallel algorithms we assume that G is given with its \({\text{O(}}\sqrt {\text{n}} )\)-separator family.) Further applications lead, in particular, to computing a maxflow and a mincut in an undirected planar network using O(log4n) parallel steps, n1.5/log n processors or alternatively O(log3n) steps, n2/log n processors, versus the known bounds, O(log2n) and n4, of [JV].


Short Path Planar Graph Parallel Algorithm Short Path Problem Path Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B]
    R. Bellman 1958, On a Routing Problem, Quart. Appl. Math. 16, 87–90.Google Scholar
  2. [BGH]
    A. Borodin, J. von zur Gathen, and J. Hopcroft, “Fast Parallel Matrix and GCD Computations”, Proc. 23-rd Ann. ACM FOCS, 65–71 (1982) and Information and Control 53,3, 241–256 (1982).Google Scholar
  3. [F]
    R.N. Floyd 1962, Algorithm 97, Shortest Path, Comm. ACM 5, 345.Google Scholar
  4. [Fr]
    G.N. Fredericson 1984, Fast Algorithms for Shortest Paths in Planar Graphs, with Applications, CSD TR 486, Dept. of Computer Sci., Purdue Univ., W. Lafayette, IN.Google Scholar
  5. [GM]
    M. Gondran and M. Minoux 1984, Graphs and Algorithms, Wiley-Interscience, New York.Google Scholar
  6. [H]
    R. Hassin 1985, On Multicommodity Flows in Planar Graphs. Networks 14, 225–235.Google Scholar
  7. [HJ]
    R. Hassin and D.B. Johnson, An O(n log2n) Algorithm for Maximum Flow in Undirected Planar Networks, SIAM J. on Computing, to appear.Google Scholar
  8. [JV]
    D.B. Johnson and S.W. Venkatesan 1982, Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks, Proc. 23-rd Ann. IEEE Symp. FOCS, 244–254.Google Scholar
  9. [KR]
    P. Klein and J. Reif 1985, An Efficiet Parallel Algorithm for Planarity, Tech. Report, Center for Research in Computer Technology, Aiken Computation Laboratory, Harvard Univ. Cambridge, Mass.Google Scholar
  10. [L]
    E.L. Lawler 1976, Combinatorial Optimization: Networks and Matroids, Holt, Rinehard and Winston, N.Y.Google Scholar
  11. [LT]
    R.J. Lipton and R.E. Tarjan 1979, A Separator Theorem for Planar Graphs, SIAM J. Applied Math. 36, 2, 177–189.Google Scholar
  12. [MNS]
    K. Matsumoto, T. Nishizeki, N. Saito 1985, An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks, SIAM J. on Computing 14, 2, 289–302.Google Scholar
  13. [P]
    V. Pan 1984, How to Multiply Matrices Faster, Lecture Notes in Computer Science, v. 179, Springer Verlag, Berlin.Google Scholar
  14. [PR]
    V. Pan and J. Reif 1984, Fast and Efficient Solution of Linear Systems, Tech. Report TR-02-85, Center for Research in Computer Technology, Aiken Computation Laboratory, Harvard Univ., Cambridge, Mass., (extended abstract in Proc. 17-th Ann. ACM STOC, 143–152, Providence, R.I.).Google Scholar
  15. [PR1]
    V. Pan and J. Reif 1985, Fast and Efficient Algorithms for Linear Programming and for the Linear Least Squares Problem, Techn. Report TR-11-85, Center for Research in Computer Technology, Aiken Computation Laboratory, Harvard Univ., Cambridge, Mass.Google Scholar
  16. [T]
    R.E. Tarjan 1981, A Unified Approach to Path Problems, J.ACM 28, 3, 577–593.Google Scholar
  17. [Ta]
    R.E. Tarjan 1981, Fast Algorithms for Solving Path Problems, J. ACM 28, 3, 594–614.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Victor Pan
    • 1
  • John Reif
    • 2
  1. 1.Computer Science DepartmentState University of New York at AlbanyAlbany
  2. 2.Aiken Computation Lab. Division of Applied SciencesHarvard UniversityCambridge

Personalised recommendations