Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.218, Iss.2, 1999-05, pp. : 263-271
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. :
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. :