Timothy M. Chan. All-Pairs Shortest Paths with Real Weights in ::::O:::: ( ::::n:::: :::3:::/log ::::n:::: ) Time. Algorithmica, 50(2):236-243, 2008. [doi]
@article{Chan08,
title = {All-Pairs Shortest Paths with Real Weights in ::::O:::: ( ::::n:::: :::3:::/log ::::n:::: ) Time},
author = {Timothy M. Chan},
year = {2008},
doi = {10.1007/s00453-007-9062-1},
url = {http://dx.doi.org/10.1007/s00453-007-9062-1},
researchr = {https://researchr.org/publication/Chan08},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {50},
number = {2},
pages = {236-243},
}