Minimum average distance of strong orientations of graphs.

Peter Dankelmann Ortrud Oellermann Jian-Liang Wu

Published in: Discret. Appl. Math. (2004)

Keyphrases

average distance
spanning tree
graph theory
graph mining
data sets
decision trees
active learning
minimum cost
graph theoretic
connected dominating set