An optimal backtrack algorithm for tree-structured constraint satisfaction problems
type: Item
instance of: scholarly article
title: An optimal backtrack algorithm for tree-structured constraint satisfaction problems
zbMATH Open document ID: 0938.68828
DOI: 10.1016/0004-3702(94)90064-7
author: Roberto J. jun. Bayardo
author: Daniel P. Miranker
published in: Artificial Intelligence
publication date: 2000-06-21T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 708643
MaRDI profile type: Publication
full work available at URL: 0004-3702(94)90064-7
OpenAlex ID: W1979944023
cites work: Q3619797
cites work: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: Consistency in networks of relations
description: scientific article; zbMATH DE number 708643