3020 search results - page 13 / 604 » Optimal partition trees |
JCO
2006
14 years 11 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
103
click to vote
WG
2005
Springer
15 years 5 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
111
click to vote
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper, we use a level set based segmentation algorithm to extract the vascular tree from Magnetic Resonance Angiography, "MRA". Classification model finds an opt...
IPCO
2010
15 years 1 months ago
2010
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
GD
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...