All graphs have cycle separators and planar directed depth-first search is in DNC

This publication has 17 references indexed in Scilit:

• A parallel algorithm for finding a separator in planar graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• A random NC algorithm for depth first search
  Published by Association for Computing Machinery (ACM) ,1987
• Parallel symmetry-breaking in sparse graphs
  Published by Association for Computing Machinery (ACM) ,1987
• Separator-based strategies for efficient message routing
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• An efficient parallel algorithm for planarity
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• The power of parallel prefix
  IEEE Transactions on Computers, 1985
• A parallel search algorithm for directed acyclic graphs
  BIT Numerical Mathematics, 1984
• Partition of planar flow networks
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• A Separator Theorem for Planar Graphs
  SIAM Journal on Applied Mathematics, 1979
• Generalized Nested Dissection
  SIAM Journal on Numerical Analysis, 1979