Bi-cyclic decompositions of complete graphs into spanning trees.

Dalibor Froncek

Published in: Discret. Math. (2007)

Keyphrases

spanning tree
minimum spanning tree
minimum spanning trees
edge disjoint
minimum cost
minimum weight
undirected graph
root node
weighted graph
random walk
business intelligence
decision making
graph mining
edge weights
times faster
data structure
objective function
bayesian networks
case study