Sciweavers

262 search results - page 2 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
MICCAI
2005
Springer
14 years 7 months ago
Automatic Vascular Tree Formation Using the Mahalanobis Distance
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
Julien Jomier, Vincent LeDigarcher, Stephen R. Ayl...
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 6 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
13 years 10 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
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...
Thang Nguyen Bui, Catherine M. Zrncic
SAC
2000
ACM
13 years 10 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
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...
Günther R. Raidl, Bryant A. Julstrom
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
13 years 11 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom