A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tdsc/GfellerSW11
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tdsc/GfellerSW11
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Beat_Gfeller
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nicola_Santoro
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Widmayer
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FTDSC.2009.17
>
foaf:
homepage
<
https://doi.org/10.1109/TDSC.2009.17
>
dc:
identifier
DBLP journals/tdsc/GfellerSW11
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FTDSC.2009.17
(xsd:string)
dcterms:
issued
2011
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tdsc
>
rdfs:
label
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Beat_Gfeller
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nicola_Santoro
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Widmayer
>
swrc:
number
1
(xsd:string)
swrc:
pages
1-12
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tdsc/GfellerSW11/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tdsc/GfellerSW11
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tdsc/tdsc8.html#GfellerSW11
>
rdfs:
seeAlso
<
https://doi.org/10.1109/TDSC.2009.17
>
dc:
title
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
8
(xsd:string)