Login / Signup
Worst-case efficient dominating sets in digraphs.
Italo J. Dejter
Published in:
Discret. Appl. Math. (2013)
Keyphrases
</>
worst case
greedy algorithm
real time
case study
lower bound
upper bound
lightweight
website
image segmentation
search algorithm
computational complexity
np hard
highly efficient
markov models