Login / Signup

Estimation of the domination number in sparse random graphs and applications.

Martin NehézDusan BernátMarek Lelovský
Published in: ECBS (2017)
Keyphrases
  • random graphs
  • bayesian networks
  • reinforcement learning
  • computational complexity
  • shortest path
  • ranking algorithm