![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Wu B.Y. Chao K-M. Tang C.Y.
Publisher: Academic Press
ISSN: 0196-6774
Source: Journal of Algorithms, Vol.36, Iss.2, 2000-08, pp. : 182-204
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Fujisawa Jun
Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. :