R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks

Paolo D Alberto, Alexandru Nicolau. R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks. Algorithmica, 47(2):203-213, 2007. [doi]

@article{DAlbertoN07,
  title = {R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks},
  author = {Paolo D Alberto and Alexandru Nicolau},
  year = {2007},
  doi = {10.1007/s00453-006-1224-z},
  url = {http://dx.doi.org/10.1007/s00453-006-1224-z},
  researchr = {https://researchr.org/publication/DAlbertoN07},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {47},
  number = {2},
  pages = {203-213},
}