Title of article
Note on complexity of computing the domination of binary systems
Author/Authors
A.A. Chernyak، نويسنده , , Zh.A. Chernyak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
7
From page
289
To page
295
Abstract
The problem of computing the domination of a coherent binary system all minimal paths sets of which have equal cardinality k (k > 1), is proved to be #P-complete. Some corollaries are given.
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884501
Link To Document