%0 Journal Article %1 journals/networks/RaviMR92 %A Ravi, R. %A Marathe, Madhav V. %A Rangan, C. Pandu %D 1992 %J Networks %K dblp %N 1 %P 21-35 %T An optimal algorithm to solve the all-pair shortest path problem on interval graphs. %U http://dblp.uni-trier.de/db/journals/networks/networks22.html#RaviMR92 %V 22

@article{journals/networks/RaviMR92, added-at = {2015-08-31T00:00:00.000+0200}, author = {Ravi, R. and Marathe, Madhav V. and Rangan, C. Pandu}, biburl = {https://www.bibsonomy.org/bibtex/2c5841b0f5420279c3ae9cc54e82f1ad2/dblp}, ee = {http://dx.doi.org/10.1002/net.3230220103}, interhash = {0f0686f813b168c42058e1ce316bb4a8}, intrahash = {c5841b0f5420279c3ae9cc54e82f1ad2}, journal = {Networks}, keywords = {dblp}, number = 1, pages = {21-35}, timestamp = {2015-09-01T11:33:44.000+0200}, title = {An optimal algorithm to solve the all-pair shortest path problem on interval graphs.}, url = {http://dblp.uni-trier.de/db/journals/networks/networks22.html#RaviMR92}, volume = 22, year = 1992 }