Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

On the Euclidean Minimum Spanning Tree Problem

By Rajasekaran Sanguthevar  

Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. : 11-14

VSP

Access to resources Recommend Favorite

The Stackelberg Minimum Spanning Tree Game

By Cardinal Jean   Demaine Erik   Fiorini Samuel   Joret Gwenaël   Langerman Stefan   Newman Ilan   Weimann Oren  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 129-144

Springer Publishing Company

Access to resources Recommend Favorite

Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance

By Zhang Binwu   Zhang Jianzhong   He Yong  

Journal of Global Optimization, Vol. 34, Iss. 3, 2006-03 ,pp. : 467-474

Springer Publishing Company

Access to resources Recommend Favorite

On the prize-collecting generalized minimum spanning tree problem

By Pop P.  

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 193-204

Springer Publishing Company

Access to resources Recommend Favorite