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

An edge-swap heuristic for generating spanning trees with minimum number of branch vertices

By Silva Ricardo   Silva Diego   Resende Mauricio   Mateus Geraldo   Gonçalves José   Festa Paola  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1225-1243

Springer Publishing Company

Access to resources Recommend Favorite

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

Degree Bounded Spanning Trees

By Fujisawa Jun  

Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. : 695-720

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