277 search results - page 37 / 56 » The saga of minimum spanning trees |
120
Voted
ALGORITHMICA
2010
15 years 27 days ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
118
Voted
ENDM
2010
15 years 25 days 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...
110
click to vote
NI
2011
14 years 3 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...
101
Voted
JOIN
2007
15 years 19 days 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 ...
109
Voted
CVPR
2007
IEEE
16 years 2 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...