Sciweavers

Share
2 search results - page 1 / 1
» Binary subtrees with few labeled paths
Sort
View
COMBINATORICA
2011
8 years 2 months ago
Binary subtrees with few labeled paths
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 ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
AAAI
2004
9 years 3 months ago
Tractable Tree Convex Constraint Networks
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 ...
Yuanlin Zhang, Eugene C. Freuder
books