Parallel depth first search. Part II. Analysis
- 1 December 1987
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 16 (6), 501-519
- https://doi.org/10.1007/bf01389001
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A hypercube algorithm for the 0/1 Knapsack problemJournal of Parallel and Distributed Computing, 1988
- DIB—a distributed implementation of backtrackingACM Transactions on Programming Languages and Systems, 1987
- On Maintaining Dynamic Information in a Concurrent EnvironmentSIAM Journal on Computing, 1986
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search ProblemsIEEE Transactions on Computers, 1984
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, 1983