279 search results - page 38 / 56 » Degree-bounded minimum spanning trees |
ENDM
2010
13 years 7 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
NI
2011
12 years 10 months ago
2011
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
JOIN
2007
13 years 7 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
PPSN
2004
Springer
14 years 22 days ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...