Bounded-degree spanning tree problems: models and new algorithms

ISSN： 0926-6003

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

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

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

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

Extremal Problems For Transversals In Graphs With Bounded Degree

By Szabó* Tibor Tardos† Gábor

Combinatorica, Vol. 26, Iss. 3, 2006-06 ,pp. : 333-351

Springer Publishing Company

Access to resources Recommend Favorite

Formulations and exact solution approaches for the degree preserving spanning tree problem

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 329-343

John Wiley & Sons Inc

Access to resources Recommend Favorite