2492 search results - page 132 / 499 » On the General Signature Trees |
161
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
179
click to vote
JCT
2011
15 years 1 months ago
2011
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
187
click to vote
JMLR
2010
15 years 1 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
198
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
118
click to vote
CCCG
2003
15 years 7 months ago
2003
We prove that for any two simple chains [more generally, trees] in Rd with corresponding edges parallel, there is a parallel morph between them—i.e. a morph in which all interme...