Not complementary connected and not CIS d-graphs form weakly monotone families.

Diogo Vieira Andrade Endre Boros Vladimir Gurvich

Published in: Discret. Math. (2010)

Keyphrases

data sets
information retrieval
upper bound
graph matching
graph theoretic
genetic algorithm
random walk
graph theory