مرکز منطقه ای اطلاع رساني علوم و فناوري - Algorithms for parsimonious complete sets in directed graphs

Title of article :

Algorithms for parsimonious complete sets in directed graphs

Author/Authors :

Avraham A. Melkman، نويسنده , , Solomon E. Shimony، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1996

Pages :

From page :

335

To page :

339

Keywords :

Algorithms , Complete sets , Proof graphs , Parsimonious , Abduction

Journal title :

Information Processing Letters

Serial Year :

1996

Journal title :

Information Processing Letters

Record number :

128557

Link To Document :