Parallel nested dissection for path algebra computations

[1]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[2]  Philip N. Klein,et al.  An efficient parallel algorithm for planarity , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[3]  Gary L. Miller,et al.  Finding Small Simple Cycle Separators for 2-Connected Planar Graphs , 1986, J. Comput. Syst. Sci..

[4]  Refael Hassin,et al.  An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks , 1985, SIAM J. Comput..

[5]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[6]  Victor Y. Pan,et al.  How to Multiply Matrices Faster , 1984, Lecture Notes in Computer Science.

[7]  John H. Reif,et al.  Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time , 1983, SIAM J. Comput..

[8]  Donald B. Johnson,et al.  Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) , 1982, FOCS.

[9]  John H. Reif,et al.  Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time , 1981, ICALP.

[10]  Robert E. Tarjan,et al.  A Unified Approach to Path Problems , 1981, JACM.

[11]  Robert E. Tarjan,et al.  Fast Algorithms for Solving Path Problems , 1981, JACM.

[12]  D. Rose,et al.  Generalized nested dissection , 1977 .

[13]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[14]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[15]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .