Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys.

Bryant A. Julstrom

Published in: GECCO (1) (2004)

Keyphrases

spanning tree
edge disjoint
minimum cost
minimum spanning tree
minimum spanning trees
minimum total cost
probability distribution
undirected graph
depth first search
total length
high level
random walk
integrity constraints
weighted graph
root node
maximum distance