Minimum number of below average triangles in a weighted complete graph.

Gareth Bendall François Margot

Published in: Discret. Optim. (2006)

Keyphrases

graph theory
weighted graph
computational complexity
structured data
edge weights
special case
random walk
standard deviation
minimum cost
constant factor