Author： Kim Jong-Seok Lee Hyeong-Ok Cheng Eddie Lipták László
Publisher： Springer Publishing Company
ISSN： 0920-8542
Source： The Journal of Supercomputing, Vol.56, Iss.2, 2011-05, pp. : 212-225
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
How to Use Spanning Trees to Navigate in Graphs
Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. :
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. :