Cost-error relationships in A* tree-searching

DOI10.1145/77600.77595zbMath0696.68053MaRDI QIDQ3474277

Henry W. Davis

Publication date: 1990

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/77600.77595

zbMATH Keywords

heuristic methods; graph and tree search strategies

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P10: Searching and sorting

68R10: Graph theory (including graph drawing) in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Average-case analysis of best-first search in two representative directed acyclic graphs, New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.