Algorithms for parsimonious complete sets in directed graphs.

Algorithms for parsimonious complete sets in directed graphs.

Dades bibliogràfiques
Publicat a:Information processing letters. 59, 6 (1996).
Autor principal: Melkman, Avraham A.
Format: Article
Idioma:English
Matèries:
Algorithms.
Proof graphs.
Parsimonious.
Abduction.
Complete sets.