Beate Bollig. On symbolic OBDD-based algorithms for the minimum spanning tree problem. Theoretical Computer Science, 447:2-12, 2012. [doi]
@article{Bollig12,
title = {On symbolic OBDD-based algorithms for the minimum spanning tree problem},
author = {Beate Bollig},
year = {2012},
doi = {10.1016/j.tcs.2011.11.029},
url = {http://dx.doi.org/10.1016/j.tcs.2011.11.029},
researchr = {https://researchr.org/publication/Bollig12},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {447},
pages = {2-12},
}