Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/icppw/MaoL02>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Li-Jen_Mao>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Sheau-Dong_Lang>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2FICPPW.2002.1039757>
foaf:homepage	<https://doi.org/10.1109/ICPPW.2002.1039757>
dc:identifier	DBLP conf/icppw/MaoL02 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2FICPPW.2002.1039757 (xsd:string)
dcterms:issued	2002 (xsd:gYear)
rdfs:label	Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Li-Jen_Mao>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Sheau-Dong_Lang>
swrc:pages	398-404 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/icppw/2002>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/icppw/MaoL02/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/icppw/MaoL02>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/icppw/icppw2002.html#MaoL02>
rdfs:seeAlso	<https://doi.org/10.1109/ICPPW.2002.1039757>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/icppw>
dc:subject	Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal (xsd:string)
dc:title	Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document