44 search results - page 1 / 9 » An ant-based algorithm for finding degree-constrained minimu... |
169
click to vote
SAC
2000
ACM
15 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...
140
click to vote
WEA
2007
Springer
15 years 12 months ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
154
Voted
GECCO
2006
Springer
15 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...
166
Voted
WDAG
2007
Springer
15 years 12 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
136
Voted
ESA
1998
Springer
15 years 10 months ago
1998
Springer