Lélia Blin, Franck Butelle. The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. In 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings. pages 161, IEEE Computer Society, 2003. [doi]
@inproceedings{BlinB03,
title = {The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs},
author = {Lélia Blin and Franck Butelle},
year = {2003},
url = {http://csdl.computer.org/comp/proceedings/ipdps/2003/1926/00/19260161aabs.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BlinB03},
cites = {0},
citedby = {0},
pages = {161},
booktitle = {17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-1926-1},
}