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]
@article{MartinezC10-2,
title = {Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm},
author = {Leonardo Conegundes Martinez and Alexandre Salles da Cunha},
year = {2010},
doi = {10.1016/j.endm.2010.05.040},
url = {http://dx.doi.org/10.1016/j.endm.2010.05.040},
researchr = {https://researchr.org/publication/MartinezC10-2},
cites = {0},
citedby = {0},
journal = {Electronic Notes in Discrete Mathematics},
volume = {36},
pages = {311-318},
}