{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:06:42Z","timestamp":1773086802863,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1007\/bf01389000","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T09:38:27Z","timestamp":1112434707000},"page":"479-499","source":"Crossref","is-referenced-by-count":108,"title":["Parallel depth first search. Part I. Implementation"],"prefix":"10.1007","volume":"16","author":[{"given":"V. Nageshwara","family":"Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"CR1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF01389001","volume":"16","author":"Vipin Kumar","year":"1988","unstructured":"Vipin Kumar and V. Nageshwara Rao, Parallel Depth-first Search, Part II: Analysis,International Journal of Parallel Programming,16(6):501?519 (1988).","journal-title":"International Journal of Parallel Programming"},{"key":"CR2","first-page":"1004","volume-title":"Depth-first Search,Encyclopaedia of Artificial Intelligence","author":"Vipin Kumar","year":"1987","unstructured":"Vipin Kumar, Depth-first Search,Encyclopaedia of Artificial Intelligence, John Wiley and Sons, Inc., New York,2:1004?1005 (1987)."},{"key":"CR3","volume-title":"Heuristics?Intelligent Search Strategies for Computer Problem Solving","author":"Judea Pearl","year":"1984","unstructured":"Judea Pearl,Heuristics?Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, Massachusetts (1984)."},{"key":"CR4","volume-title":"Fundamentals of Computer Algorithms","author":"Ellis Horowitz","year":"1978","unstructured":"Ellis Horowitz and Sartaj Sahni,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, Maryland (1978)."},{"key":"CR5","unstructured":"Bogumil Hausman, Andrzej Ciepielewski, and Seif Haridi, OR-parallelProlog made Efficient on Shared Memory Multiprocessors,Proceedings of the Fourth Symposium on Logic Programming, San Francisco, CA., pp. 69?79 (September 1987)."},{"key":"CR6","volume-title":"Implementations of Prolog","author":"M. H. Emden van","year":"1984","unstructured":"M. H. van Emden, An Interpreting Algorithm for Prolog Programs,Implementations of Prolog, J. A. Campbell, (ed.), Ellis Horwood, West Sussex, England (1984)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"R. E. Korf, Depth-first Iterative-deepening: An Optimal Admissible Tree Search,Artificial Intelligence,27:97?109 (1985).","journal-title":"Artificial Intelligence"},{"key":"CR8","volume-title":"Search in Artificial Intelligence","author":"Richard Korf","year":"1988","unstructured":"Richard Korf, Optimal Path Finding Algorithms,Search in Artificial Intelligence, L. Kanal and V. Kumar, (eds.), Springer-Verlag, New York (1988)."},{"key":"CR9","unstructured":"M. E. Stickel and W. M. Tyson, An Analysis of Consecutively Bounded Depth-first Search with Applications in Automated Deduction,IJCAI, pp. 1073?1075 (1985)."},{"key":"CR10","unstructured":"M. Imai, Y. Yoshida, and T. Fukumura, A Parallel Searching Scheme for Multiprocessor Systems and Its Application to Combinatorial Problems,IJCAI, pp. 416?418 (1979)."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Benjamin W. Wah and Y. W. Eva Ma, Manip?A Multicomputer Architecture for Solving Combinatorial Extremum-search Problems,IEEE Transactions on Computers, vol. C-33 (May 1984).","DOI":"10.1109\/TC.1984.1676453"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/TPAMI.1984.4767600","volume":"6","author":"V. Kumar","year":"1984","unstructured":"V. Kumar and L. N. Kanal, Parallel Branch-and-bound Formulations for and\/or Tree Search,IEEE Trans. Pattern. Anal. and Machine Intell.,PAMI 6:768?778 (1984).","journal-title":"IEEE Trans. Pattern. Anal. and Machine Intell., PAMI"},{"issue":"2","key":"CR13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/22719.24067","volume":"9","author":"Raphael A. Finkel","year":"1987","unstructured":"Raphael A. Finkel and Udi Manber, DIB?A Distributed Implementation of Backtracking,ACM Trans. of Progr. Lang. and Systems,9(2):235?256 (April 1987).","journal-title":"ACM Trans. of Progr. Lang. and Systems"},{"key":"CR14","series-title":"Technical Report","volume-title":"The Ring Machine","author":"B. Monien","year":"1985","unstructured":"B. Monien and O. Vornberger,The Ring Machine Technical Report, Univ. of Paderborn, FRG (1985); also inComputers and Artificial Intelligence, Vol. 3 (1987)."},{"key":"CR15","unstructured":"Virendra K. Janakiram, Dharma P. Agrawal, and Ram Mehrotra, Randomized Parallel Algorithms for Prolog Programs and Backtracking Application,Proceedings of International Conference on Parallel Processing, pp. 278?281 (1987)."},{"key":"CR16","unstructured":"Nils J. Nilsson,Principles of Artificial Intelligence, Tioga Press (1980)."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"E. L. Lawler and D. Woods, Branch-and-bound Methods: A Survey,Operations Research, Vol. 14 (1966).","DOI":"10.1287\/opre.14.4.699"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0004-3702(83)80009-5","volume":"21","author":"V. Kumar","year":"1983","unstructured":"V. Kumar and L. N. Kanal, A General Branch-and-bound Formulations for Understanding and Synthesizing and\/or Tree Search Procedures,Artificial Intelligence,21:179?198 (1983).","journal-title":"Artificial Intelligence"},{"key":"CR19","volume-title":"Search in Artificial Intelligence","author":"Vipin Kumar","year":"1988","unstructured":"Vipin Kumar, Dana Nau and Laveen Kanal, General Branch-and-bound Formulation for and\/or Graph and Game Tree Search (eds.), L. Kanal andV. Kumar,Search in Artificial Intelligence, (eds.), Springer-Verlag, New York (1988)."},{"key":"CR20","unstructured":"T. H. Lai and Sartaj Sahni, Anomalies in Parallel Branch and Bound Algorithms,Proceedings of International conference on Parallel Processing, pp. 183?190 (1983)."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Guo-Jie Li and Benjamin W. Wah, Coping with Anomalies in Parallel Branch-and-bound Algorithms,IEEE Trans on Computers, Vol. C-35 (June 1986).","DOI":"10.1109\/TC.1986.5009434"},{"issue":"5","key":"CR22","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E. W. Dijkstra","year":"1983","unstructured":"E. W. Dijkstra, W. H. Seijen, and A. J. M. Van Gasteren, Derivation of a Termination Detection Algorithm for a Distributed Computation,Information Processing Letters,16(5):217?219 (1983).","journal-title":"Information Processing Letters"},{"key":"CR23","unstructured":"V. Nageshwara Rao, Vipin Kumar, and K. Ramesh, A Parallel Implementation of Iterative-deeping-a*,Proceedings of the National Conf. on Artificial Intelligence AAAI, pp. 878?882 (1987)."},{"issue":"1","key":"CR24","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"Charles Seitz","year":"1985","unstructured":"Charles Seitz, The Cosmic Cube,Commun. ACM,28(1):22?23 (1985).","journal-title":"Commun. ACM"},{"key":"CR25","unstructured":"V. Nageshwara Rao and Vipin Kumar,Superlinear Speedup in State-Space Search, Technical Report, AI Lab TR88-80, University of Texas at Austin (June 1988)."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TC.1980.1675681","volume":"29","author":"O. I. El-Dessouki","year":"1980","unstructured":"O. I. El-Dessouki and W. H. Huen, Distributed Enumeration on Network Computers,IEEE Transactions on Computers,C-29:818?825 (September 1980).","journal-title":"IEEE Transactions on Computers, C"},{"key":"CR27","unstructured":"S. Kasif, M. Kohli, and J. Minker,PRISM: A Parallel Inference System for Problem Solving, Technical Report, Computer Science Department, University of Maryland (February 1983)."},{"key":"CR28","unstructured":"K. Kumon, H. Masuzawa, A. Itashiki, K. Satoh, and Y. Sohma, Kabu-wake: A New Parallel Inference Method and Its Evaluation,Proceedings of COMPCON 86 (March 1986)."},{"key":"CR29","unstructured":"Kish Shen and David H. D. Warren, A Simulation Study of the Argonne Model for OR-parallel Execution ofProlog,Proceedings of the Fourth Symposium on Logic Programming, San Francisco, CA, pp. 54?68 (September 1987)."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Peter Tinker, Performance and Pragmatics of an OR-parallel Logic Programming System,International Journal of Parallel Programmibng (1988).","DOI":"10.1007\/BF01379323"},{"key":"CR31","unstructured":"Terry Disz, Ewing Lusk, and Ross Overbeek, Experiments with OR-parallel Logic Programs,Proceedings of the Fourth International Conference on Logic Programming, Melbourne, Australia, pp. 576?600 (May 1987)."},{"key":"CR32","volume-title":"Search in Artificial Intelligence","author":"Bernard Nadel","year":"1988","unstructured":"Bernard Nadel, Constraint Satisfaction Algorithms,Search in Artificial Intelligence, L. Kanal and V. Kumar, (eds.), Springer-Verlag, New York (1988)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01389000\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01389000.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01389000\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01389000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:36:08Z","timestamp":1586190968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01389000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["BF01389000"],"URL":"https:\/\/doi.org\/10.1007\/bf01389000","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}