%0 Journal Article %1 journals/algorithmica/Duin04 %A Duin, Cees %D 2004 %J Algorithmica %K dblp %N 2 %P 131-145 %T A Branch-Checking Algorithm for All-Pairs Shortest Paths. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica41.html#Duin04 %V 41

@article{journals/algorithmica/Duin04, added-at = {2005-01-25T00:00:00.000+0100}, author = {Duin, Cees}, biburl = {https://www.bibsonomy.org/bibtex/29ee7822c05da8e69338d2eb607038928/dblp}, date = {2005-01-25}, description = {dblp}, ee = {http://dx.doi.org/10.1007/s00453-004-1122-1}, interhash = {7aceebc70a7ce3a0d47e0e105f2a0251}, intrahash = {9ee7822c05da8e69338d2eb607038928}, journal = {Algorithmica}, keywords = {dblp}, number = 2, pages = {131-145}, timestamp = {2005-01-25T00:00:00.000+0100}, title = {A Branch-Checking Algorithm for All-Pairs Shortest Paths.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica41.html#Duin04}, volume = 41, year = 2004 }