335 search results - page 3 / 67 » How to Use Spanning Trees to Navigate in Graphs |
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
COMBINATORICA
2004
13 years 5 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...
PR
2007
13 years 5 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
JGAA
2008
13 years 6 months ago
2008
SAC
2000
ACM
13 years 10 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...