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

Author： Fekete S.P.   Khuller S.   Klemmstein M.   Raghavachari B.   Young N.  

Publisher： Academic Press

ISSN： 0196-6774

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

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

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

Counting Minimum Weight Spanning Trees

By Broder A.Z.   Mayr E.W.  

Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. : 171-176

Academic Press

Access to resources Recommend Favorite

Data Collection for the Sloan Digital Sky Survey-A Network-Flow Heuristic

By Lupton R.   Maley F.M.   Young N.  

Journal of Algorithms, Vol. 27, Iss. 2, 1998-05 ,pp. : 339-356

Academic Press

Access to resources Recommend Favorite