970 search results - page 9 / 194 » On encodings of spanning trees |
SAC
2000
ACM
13 years 11 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
JCM
2006
13 years 7 months ago
2006
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
APPML
2010
13 years 7 months ago
2010
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
COMBINATORICA
2004
13 years 7 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...