An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Bilò, D.; Colella, F.; Gualà, L.; Leucci, S.; and Proietti, G. In Proc. of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), of Leibniz International Proceedings in Informatics (LIPIcs), In press. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
bibtex   
@INPROCEEDINGS{BiloCGInpressIPa,
  author = {Davide Bilò and Feliciano Colella and Luciano Gualà and Stefano Leucci
	and Guido Proietti},
  title = {{An Improved Algorithm for Computing All the Best Swap Edges of a
	Tree Spanner}},
  booktitle = {Proc. of the 28th International Symposium on Algorithms and Computation
	(ISAAC 2017)},
  year = {In press},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  publisher = {Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik}
}
Downloads: 0