2 search results - page 1 / 1 » Binary subtrees with few labeled paths |
121
click to vote
COMBINATORICA
2011
13 years 10 months ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
88
Voted
AAAI
2004
14 years 11 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...