On the size of graphs labeled with a condition at distance two.

John P. Georges David W. Mauro

Published in: J. Graph Theory (1996)

Keyphrases

sufficient conditions
training data
labeled graphs
bayesian networks
graph theoretic
maximum clique
feature selection
computational complexity
supervised learning
text categorization
euclidean distance
graph matching
uniform random