![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Gudmundsson J. Haverkort H. Park S.-M. Shin C.-S. Wolff A.
Publisher: Elsevier
ISSN: 0925-7721
Source: Computational Geometry, Vol.27, Iss.1, 2004-01, pp. : 87-106
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
By Kor Liah
Theory of Computing Systems, Vol. 53, Iss. 2, 2013-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Minimum Spanning Trees and Types of Dissimilarities
By Leclerc B.
European Journal of Combinatorics, Vol. 17, Iss. 2, 1996-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Factorizations of some weighted spanning tree enumerators
Journal of Combinatorial Theory, Series A, Vol. 104, Iss. 2, 2003-11 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Euclidean Bounded-Degree Spanning Tree Ratios
Discrete & Computational Geometry, Vol. 32, Iss. 2, 2004-07 ,pp. :