The minimum size of 3-graphs without a 4-set spanning no or exactly three edges.

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

Keyphrases

directed graph
minimum cost
spanning tree
image processing
computational complexity
bayesian networks
probability distribution
directed acyclic graph
undirected graph