Efficient parallel algorithms for shortest paths in planar graphs

This publication has 14 references indexed in Scilit:

• A simple parallel tree contraction algorithm
  Journal of Algorithms, 1989
• Using cellular graph embeddings in solving all pairs shortest paths problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Designing networks with compact routing tables
  Algorithmica, 1988
• On the Complexity of Covering Vertices by Faces in a Planar Graph
  SIAM Journal on Computing, 1988
• A new approach to all pairs shortest paths in planar graphs
  Published by Association for Computing Machinery (ACM) ,1987
• Deterministic coin tossing with applications to optimal parallel list ranking
  Information and Control, 1986
• Parallel Matrix and Graph Algorithms
  SIAM Journal on Computing, 1981
• New Bounds on the Complexity of the Shortest Path Problem
  SIAM Journal on Computing, 1976
• Algorithm 97: Shortest path
  Communications of the ACM, 1962
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959