A Distributed Algorithm for Finding all Best Swap Edges of a Minimum–Diameter Spanning Tree. Gfeller, B., Santoro, N., & Widmayer, P. IEEE Transactions on Dependable and Secure Computing, 8(1):1-12, 2011. Paper doi bibtex @ARTICLE{Gfeller2011Jo,
author = {Beat Gfeller and Nicola Santoro and Peter Widmayer},
title = {{A} {D}istributed {A}lgorithm for {F}inding all {B}est {S}wap {E}dges
of a {M}inimum--{D}iameter {S}panning {T}ree},
journal = {IEEE Transactions on Dependable and Secure Computing},
year = {2011},
volume = {8},
pages = {1-12},
number = {1},
bibsource = {DBLP, http://dblp.uni-trier.de},
doi = {http://dx.doi.org/10.1109/TDSC.2009.17},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4815273}
}
Downloads: 0
{"_id":"RDm4L4CY2CN2J6G4P","bibbaseid":"gfeller-santoro-widmayer-adistributedalgorithmforfindingallbestswapedgesofaminimumdiameterspanningtree-2011","author_short":["Gfeller, B.","Santoro, N.","Widmayer, P."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Beat"],"propositions":[],"lastnames":["Gfeller"],"suffixes":[]},{"firstnames":["Nicola"],"propositions":[],"lastnames":["Santoro"],"suffixes":[]},{"firstnames":["Peter"],"propositions":[],"lastnames":["Widmayer"],"suffixes":[]}],"title":"A Distributed Algorithm for Finding all Best Swap Edges of a Minimum–Diameter Spanning Tree","journal":"IEEE Transactions on Dependable and Secure Computing","year":"2011","volume":"8","pages":"1-12","number":"1","bibsource":"DBLP, http://dblp.uni-trier.de","doi":"http://dx.doi.org/10.1109/TDSC.2009.17","url":"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4815273","bibtex":"@ARTICLE{Gfeller2011Jo,\n author = {Beat Gfeller and Nicola Santoro and Peter Widmayer},\n title = {{A} {D}istributed {A}lgorithm for {F}inding all {B}est {S}wap {E}dges\n\tof a {M}inimum--{D}iameter {S}panning {T}ree},\n journal = {IEEE Transactions on Dependable and Secure Computing},\n year = {2011},\n volume = {8},\n pages = {1-12},\n number = {1},\n bibsource = {DBLP, http://dblp.uni-trier.de},\n doi = {http://dx.doi.org/10.1109/TDSC.2009.17},\n url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4815273}\n}\n\n","author_short":["Gfeller, B.","Santoro, N.","Widmayer, P."],"key":"Gfeller2011Jo","id":"Gfeller2011Jo","bibbaseid":"gfeller-santoro-widmayer-adistributedalgorithmforfindingallbestswapedgesofaminimumdiameterspanningtree-2011","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4815273"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://polybox.ethz.ch/index.php/s/wa4X7mAfU4Cgo3p/download","dataSources":["R7QLFCx79AQPLx6QS"],"keywords":[],"search_terms":["distributed","algorithm","finding","best","swap","edges","minimum","diameter","spanning","tree","gfeller","santoro","widmayer"],"title":"A Distributed Algorithm for Finding all Best Swap Edges of a Minimum–Diameter Spanning Tree","year":2011}