Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs. Bhadra, S. & Ferreira, A. J. Internet Services and Applications, 3(3):269-275, 2012.
Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs. [link]Link  Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs. [link]Paper  bibtex   
@article{ journals/jisa/BhadraF12,
  added-at = {2012-11-27T00:00:00.000+0100},
  author = {Bhadra, Sandeep and Ferreira, Afonso},
  biburl = {http://www.bibsonomy.org/bibtex/2ac85920a4e41deebd4dd1d89a8d0db2c/dblp},
  ee = {http://dx.doi.org/10.1007/s13174-012-0073-z},
  interhash = {d092fdb46fee6fcb3efeab5b689e3661},
  intrahash = {ac85920a4e41deebd4dd1d89a8d0db2c},
  journal = {J. Internet Services and Applications},
  keywords = {dblp},
  number = {3},
  pages = {269-275},
  title = {Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs.},
  url = {http://dblp.uni-trier.de/db/journals/jisa/jisa3.html#BhadraF12},
  volume = {3},
  year = {2012}
}

Downloads: 0