The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
The Arabic language is a highly flexional and morphologically very rich language. It presents serious challenges to the automatic classification of documents, one of which is deter...