Optimal Task Assignment in Linear Array Networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tc/LeeLK92
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tc/LeeLK92
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Cheol-Hoon_Lee
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dongmyun_Lee
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Myunghwan_Kim_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F12.256461
>
foaf:
homepage
<
https://doi.org/10.1109/12.256461
>
dc:
identifier
DBLP journals/tc/LeeLK92
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F12.256461
(xsd:string)
dcterms:
issued
1992
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tc
>
rdfs:
label
Optimal Task Assignment in Linear Array Networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Cheol-Hoon_Lee
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dongmyun_Lee
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Myunghwan_Kim_0001
>
swrc:
number
7
(xsd:string)
swrc:
pages
877-880
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tc/LeeLK92/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tc/LeeLK92
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tc/tc41.html#LeeLK92
>
rdfs:
seeAlso
<
https://doi.org/10.1109/12.256461
>
dc:
subject
optimal task assignment; linear array networks; distributed computing system; communication costs; NP-complete; network flow approach; task assignment; two-terminal network flow problem; computational complexity; computer networks; distributed processing.
(xsd:string)
dc:
title
Optimal Task Assignment in Linear Array Networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
41
(xsd:string)