An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. Arge, L., Bender, M. A., Demaine, E. D., Holland-Minkley, B., & Ian Munro, J. SIAM J. Comput. (SIAMCOMP), 36(6):1672-1695, 2007.
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms [link]Paper  bibtex   
@article{ dblp3296595,
  title = {An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms},
  author = {Lars Arge and Michael A. Bender and Erik D. Demaine and Bryan Holland-Minkley and J. Ian Munro},
  author_short = {Arge, L. and Bender, M. A. and Demaine, E. D. and Holland-Minkley, B. and Ian Munro, J.},
  bibtype = {article},
  type = {article},
  year = {2007},
  key = {dblp3296595},
  id = {dblp3296595},
  biburl = {http://www.dblp.org/rec/bibtex/journals/siamcomp/ArgeBDHM07},
  url = {http://dx.doi.org/10.1137/S0097539703428324},
  journal = {SIAM J. Comput. (SIAMCOMP)},
  pages = {1672-1695},
  number = {6},
  volume = {36},
  text = {SIAM J. Comput. (SIAMCOMP) 36(6):1672-1695 (2007)}
}

Downloads: 0