A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ispan/MaoDL99
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ispan/MaoDL99
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Li-Jen_Mao
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Narsingh_Deo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sheau-Dong_Lang
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FISPAN.1999.778937
>
foaf:
homepage
<
https://doi.org/10.1109/ISPAN.1999.778937
>
dc:
identifier
DBLP conf/ispan/MaoDL99
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FISPAN.1999.778937
(xsd:string)
dcterms:
issued
1999
(xsd:gYear)
rdfs:
label
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Li-Jen_Mao
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Narsingh_Deo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sheau-Dong_Lang
>
swrc:
pages
184-189
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ispan/1999
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ispan/MaoDL99/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ispan/MaoDL99
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ispan/ispan1999.html#MaoDL99
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ISPAN.1999.778937
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ispan
>
dc:
subject
Parallel approximate algorithm, degree-constrained MST, minimum spanning tree, reciprocal nearest neighbors
(xsd:string)
dc:
title
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document