Algorithms for parsimonious complete sets in directed graphs.

Detalles Bibliográficos
Publicado en:	Information processing letters. 59, 6 (1996).
Autor principal:	Melkman, Avraham A.
Formato:	Artículo
Lenguaje:	English
Materias:	Algorithms. Proof graphs. Parsimonious. Abduction. Complete sets.