Login / Signup
Super-simple (v, 4, 2) directed designs and a lower bound for the minimum size of their defining set.
M. Boostan
S. Golalizadeh
Nasrin Soltankhah
Published in:
Discret. Appl. Math. (2016)
Keyphrases
</>
lower bound
upper bound
lower and upper bounds
optimal solution
branch and bound
neural network
data sets
machine learning
website
np hard
np complete
branch and bound algorithm
finite number
spanning tree
maximum number