Login / Signup
Connected graphs without long paths.
Paul N. Balister
Ervin Györi
Jenö Lehel
Richard H. Schelp
Published in:
Discret. Math. (2008)
Keyphrases
</>
connected graphs
shortest path
markov random field
path finding
multiple paths
data sets
artificial intelligence
case study
database systems
bayesian networks
higher order