Parallel depth first search. Part I. Implementation

This publication has 13 references indexed in Scilit:

• A General Branch-and-Bound Formulation for AND/OR Graph and Game Tree Search
  Published by Springer Nature ,1988
• 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
• Coping with Anomalies in Parallel Branch-and-Bound Algorithms
  IEEE Transactions on Computers, 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
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
  IEEE Transactions on Computers, 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
• Branch-and-Bound Methods: A Survey
  Operations Research, 1966