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

E-ISSN： 1097-0037|65|4|329-343

ISSN： 0028-3045

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

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 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

On maximum degree‐based $γ$ ‐quasi‐clique problem: Complexity and exact approaches

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 71, Iss. 2, 2018-03 ,pp. : 136-152

John Wiley & Sons Inc

Access to resources Recommend Favorite

On the probabilistic min spanning tree Problem

By Boria Nicolas

Journal of Mathematical Modelling and Algorithms, Vol. 11, Iss. 1, 2012-03 ,pp. : 45-76

Springer Publishing Company

Access to resources Recommend Favorite

A non-cooperative approach to the cost spanning tree problem

By Bergantiños Gustavo

Mathematical Methods of Operations Research, Vol. 59, Iss. 3, 2004-07 ,pp. : 393-403

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