Scalable Parallel Formulations of Depth-First Search

This publication has 16 references indexed in Scilit:

• Parallel depth first search. Part II. Analysis
  International Journal of Parallel Programming, 1987
• DIB—a distributed implementation of backtracking
  ACM Transactions on Programming Languages and Systems, 1987
• On Maintaining Dynamic Information in a Concurrent Environment
  SIAM Journal on Computing, 1986
• Depth-first iterative-deepening
  Artificial Intelligence, 1985
• Parallel Branch-and-Bound Formulations for AND/OR Tree Search
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1984
• Derivation of a termination detection algorithm for distributed computations
  Information Processing Letters, 1983
• A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
  Artificial Intelligence, 1983
• The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
  IEEE Transactions on Computers, 1983
• Distributed Enumeration on Between Computers
  IEEE Transactions on Computers, 1980
• Branch-and-Bound Methods: A Survey
  Operations Research, 1966