A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees

By Fekete S.P.   Khuller S.   Klemmstein M.   Raghavachari B.   Young N.  

Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. : 310-324

Academic Press

Access to resources Recommend Favorite

Bounded-degree spanning tree problems: models and new algorithms

By Cerulli R.   Gentili M.   Iossa A.  

Computational Optimization and Applications, Vol. 42, Iss. 3, 2009-04 ,pp. : 353-370

Springer Publishing Company

Access to resources Recommend Favorite

A Spanning Tree with High Degree Vertices

By Ozeki Kenta   Yamashita Tomoki  

Graphs and Combinatorics, Vol. 26, Iss. 4, 2010-07 ,pp. : 591-596

Springer Publishing Company

Access to resources Recommend Favorite

Signpost systems and spanning trees of graphs

By Nebeský Ladislav  

Czechoslovak Mathematical Journal, Vol. 56, Iss. 3, 2006-09 ,pp. : 885-893

Springer Publishing Company

Access to resources Recommend Favorite

Increasing the Weight of Minimum Spanning Trees

By Frederickson G.N.   Solis-Oba R.  

Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. : 244-266

Academic Press

Access to resources Recommend Favorite