%0 Journal Article %1 journals/corr/abs-1908-06806 %A Yamane, Yasuo %A Kobayashi, Kenichi %D 2019 %J CoRR %K dblp %T A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees. %U http://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-06806 %V abs/1908.06806

@article{journals/corr/abs-1908-06806, added-at = {2019-08-26T00:00:00.000+0200}, author = {Yamane, Yasuo and Kobayashi, Kenichi}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2084f3f6d07ee456cf266cb3961b18593/dblp}, ee = {http://arxiv.org/abs/1908.06806}, interhash = {431fc9139dde05d13b90533d5fe37f5d}, intrahash = {084f3f6d07ee456cf266cb3961b18593}, journal = {CoRR}, keywords = {dblp}, timestamp = {2019-09-27T09:51:10.000+0200}, title = {A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees.}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-06806}, volume = {abs/1908.06806}, year = 2019 }