720 search results - page 3 / 144 » Linear k-arboricities on trees |
ISAAC
2009
Springer
14 years 9 days ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
DLT
2006
13 years 7 months ago
2006
Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during ...
WADS
2009
Springer
14 years 10 days ago
2009
Springer
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
KDD
2002
ACM
14 years 6 months ago
2002
ACM
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...