Sciweavers

2487 search results - page 2 / 498
» Partitions of Graphs into Trees
Sort
View
WG
2005
Springer
13 years 11 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
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...
Ross M. McConnell, Fabien de Montgolfier
CVPR
2008
IEEE
14 years 6 days ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...
ICIP
2008
IEEE
14 years 6 days ago
Augmented tree partitioning for interactive image segmentation
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian...
ARSCOM
2007
191views more  ARSCOM 2007»
13 years 5 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 9 days ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda