A lower bound for the number of orientable triangular embeddings of some complete graphs.

Mike J. Grannell Martin Knor

Published in: J. Comb. Theory, Ser. B (2010)

Keyphrases

lower bound
upper bound
small number
objective function
maximum number
data sets
similarity measure
data structure
search algorithm
computational complexity