A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/wdag/GfellerSW07
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/wdag/GfellerSW07
>
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.1007%2F978-3-540-75142-7%5F22
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-75142-7_22
>
dc:
identifier
DBLP conf/wdag/GfellerSW07
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-75142-7%5F22
(xsd:string)
dcterms:
issued
2007
(xsd:gYear)
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:
pages
268-282
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/wdag/2007
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/wdag/GfellerSW07/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/wdag/GfellerSW07
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/wdag/disc2007.html#GfellerSW07
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-75142-7_22
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/wdag
>
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:InProceedings
rdf:
type
foaf:Document