Author： Dragan Feodor Xiang Yang
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.66, Iss.3, 2013-07, pp. : 479-511
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Access to resources
Recommend
Non-uniform random spanning trees on weighted graphs
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :
Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs
By Lin C.-T.
Journal of Parallel and Distributed Computing, Vol. 63, Iss. 12, 2003-12 ,pp. :
By Emek Yuval
Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. :
Improving spanning trees by upgrading nodes
By Krumke S.O. Noltemeier H. Wirth H.-C. Marathe M.V. Ravi R. Ravi S.S. Sundaram R.
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :