A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ton/GuoL10
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ton/GuoL10
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Song_Guo_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Victor_C._M._Leung
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FTNET.2009.2038998
>
foaf:
homepage
<
https://doi.org/10.1109/TNET.2009.2038998
>
dc:
identifier
DBLP journals/ton/GuoL10
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FTNET.2009.2038998
(xsd:string)
dcterms:
issued
2010
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ton
>
rdfs:
label
A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Song_Guo_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Victor_C._M._Leung
>
swrc:
number
4
(xsd:string)
swrc:
pages
1067-1076
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ton/GuoL10/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ton/GuoL10
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ton/ton18.html#GuoL10
>
rdfs:
seeAlso
<
https://doi.org/10.1109/TNET.2009.2038998
>
dc:
title
A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
18
(xsd:string)