970 search results - page 3 / 194 » On encodings of spanning trees |
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
GECCO
2007
Springer
14 years 13 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
GECCO
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
COCOC
1995
13 years 9 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
LATIN
1995
Springer
13 years 9 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...