A new variant of the \(A^*\)-algorithm which closes a node at most once.
type: Item
instance of: scholarly article
title: A new variant of the \(A^*\)-algorithm which closes a node at most once.
zbMATH Open document ID: 1034.68712
DOI: 10.1007/BF01531177
author: Sukhamay Kundu
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 1005856
zbMATH Keywords: \(A^*\)-algorithm
MaRDI profile type: Publication
cites work: Q4091421
cites work: Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
cites work: Heuristic search through islands
cites work: On the optimality of A
cites work: The heuristic search under conditions of error
cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: On the complexity of admissible search algorithms
cites work: A heuristic search algorithm with modifiable estimate
full work available at URL: https://doi.org/10.1007/bf01531177
OpenAlex ID: W2026091073
Recommended article: A New Algorithm for Computing the Maximal Closure of a Graph
Recommended article: A depth-first search algorithm for computing pseudo-closed sets
Recommended article: A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
Recommended article: Q3727385
Recommended article: An improved algorithm for transitive closure on acyclic digraphs
Recommended article: A new approach for approximating node deletion problems
Recommended article: A variant of the Ford-Johnson algorithm that is more space efficient
Recommended article: A New Algorithm for Finding a Pseudoperipheral Node in a Graph
Recommended article: Q4694753
description: scientific article; zbMATH DE number 1005856