Stop the war!
Остановите войну!
for scientists:
default search action
"A simple O(n2) algorithm for the all-pairs shortest path ..."
Prakash Mirchandani (1996)
- Prakash Mirchandani:
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph. Networks 27(4): 215-217 (1996)
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.