Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm

Leonardo Conegundes Martinez, Alexandre Salles da Cunha. Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm. Electronic Notes in Discrete Mathematics, 36:311-318, 2010. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: