![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record journals/networks/Mirchandani96
@article{DBLP:journals/networks/Mirchandani96, author = {Prakash Mirchandani}, title = {A simple O(n\({}^{\mbox{2}}\)) algorithm for the all-pairs shortest path problem on an interval graph}, journal = {Networks}, volume = {27}, number = {4}, pages = {215--217}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1097-0037(199605)27:3\<215::AID-NET6\>3.0.CO;2-L}, doi = {10.1002/(SICI)1097-0037(199605)27:3\<215::AID-NET6\>3.0.CO;2-L}, timestamp = {Sun, 28 May 2017 13:19:55 +0200}, biburl = {https://dblp.org/rec/journals/networks/Mirchandani96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.