Algorithms for parsimonious complete sets in directed graphs.

Detalhes bibliográficos
Publicado no:	Information processing letters. 59, 6 (1996).
Autor principal:	Melkman, Avraham A.
Formato:	Artigo
Idioma:	English
Assuntos:	Algorithms. Proof graphs. Parsimonious. Abduction. Complete sets.