Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. Nanongkai, D., Saranurak, T., & Wulff-Nilsen, C. CoRR, 2017.
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time [link]Paper  bibtex   
@article{DBLP:journals/corr/abs-1708-03962,
  author    = {Danupon Nanongkai and
               Thatchaphol Saranurak and
               Christian Wulff{-}Nilsen},
  title     = {Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update
               Time},
  journal   = {CoRR},
  volume    = {abs/1708.03962},
  year      = {2017},
  url       = {http://arxiv.org/abs/1708.03962},
  archivePrefix = {arXiv},
  eprint    = {1708.03962},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1708-03962.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0