2487 search results - page 167 / 498 » Partitions of Graphs into Trees |
143
Voted
PR
2010
15 years 2 months ago
2010
Motion capture, a currently active research area, needs estimation of the pose of the subject. For this purpose, we match the tree representation of the skeleton of the 3D shape t...
114
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
128
Voted
SIAMDM
2008
15 years 3 months ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
136
Voted
DBPL
2007
Springer
15 years 9 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
128
Voted
ICTAI
2006
IEEE
15 years 9 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...