Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/ispan/MaoDL99
%A Mao, Li-Jen
%A Deo, Narsingh
%A Lang, Sheau-Dong
%B ISPAN
%D 1999
%I IEEE Computer Society
%K dblp
%P 184-189
%T A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.
%U http://dblp.uni-trier.de/db/conf/ispan/ispan1999.html#MaoDL99
%@ 0-7695-0231-8
@inproceedings{conf/ispan/MaoDL99,
added-at = {2023-03-24T00:00:00.000+0100},
author = {Mao, Li-Jen and Deo, Narsingh and Lang, Sheau-Dong},
biburl = {https://www.bibsonomy.org/bibtex/28ad1e0eaff57571f5afc8f5d6e14cf04/dblp},
booktitle = {ISPAN},
crossref = {conf/ispan/1999},
ee = {https://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778937},
interhash = {0fde62b4277eb5097a40eb96af24c2af},
intrahash = {8ad1e0eaff57571f5afc8f5d6e14cf04},
isbn = {0-7695-0231-8},
keywords = {dblp},
pages = {184-189},
publisher = {IEEE Computer Society},
timestamp = {2024-04-10T18:15:26.000+0200},
title = {A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.},
url = {http://dblp.uni-trier.de/db/conf/ispan/ispan1999.html#MaoDL99},
year = 1999
}