Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees.

Klas Markström Andrzej Rucinski

Published in: Eur. J. Comb. (2011)

Keyphrases

graph theory
decomposition methods
data mining
three dimensional
high quality
reinforcement learning
optimal solution
cooperative
np hard
probabilistic model
description logics