Parallel depth first search. Part II. Analysis-Reference-Cited by-同舟云学术

Parallel depth first search. Part II. Analysis

Published:1987-12 Issue:6 Volume:16 Page:501-519
ISSN:0885-7458
Container-title:International Journal of Parallel Programming
language:en
Short-container-title:Int J Parallel Prog

Author:

Kumar Vipin,Rao V. Nageshwara

Publisher

Springer Science and Business Media LLC

Subject

Information Systems,Theoretical Computer Science,Software

Link

http://link.springer.com/article/10.1007/BF01389001/fulltext.html

Reference14 articles.

1. V. Nageshwara Rao and Vipin Kumar, Parallel Depth-first Search, Part I: Implementation.International Journal of Parallel Programming,16(6), 479?499 (1988).

2. R. E. Korf, Depth-first Iterative-deepening: An Optimal Admissible Tree Search,Artificial Intelligence,27:97?109 (1985).

3. Richard Korf, Optimal Path Finding Algorithms, In L. Kanal and V. Kumar, (eds.),Search in Artificial Intelligence, Springer-Verlag, New York (1988).

4. Nils J. Nilsson,Principles of Artificial Intelligence, Tioga Press (1980).

5. 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).

Cited by 103 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Artificial intelligence for video game visualization, advancements, benefits and challenges;Mathematical Biosciences and Engineering;2023

2. A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations;Computers & Operations Research;2019-09

3. Parallel Detection of Subsystems in Linear Systems Arising in the MESHFREE Finite Pointset Method;Meshfree Methods for Partial Differential Equations IX;2019

4. A parallel algorithm for train rescheduling;Transportation Research Part C: Emerging Technologies;2018-10

5. Parallel generated method of transcriptional regulatory networks;Concurrency and Computation: Practice and Experience;2018-09-17