Login / Signup
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs.
Zi-Long Liu
Fang Tian
Jun-Ming Xu
Published in:
Theor. Comput. Sci. (2009)
Keyphrases
</>
upper bound
data analysis
image analysis
connected components
generative model
statistical analysis
graph theoretic
bayesian networks
lower bound
probabilistic model
worst case