Algorithms for parsimonious complete sets in directed graphs.

Algorithms for parsimonious complete sets in directed graphs.

Bibliografiske detaljer
Udgivet i:Information processing letters. 59, 6 (1996).
Hovedforfatter: Melkman, Avraham A.
Format: Article
Sprog:English
Fag:
Algorithms.
Proof graphs.
Parsimonious.
Abduction.
Complete sets.