Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/166735| Title: | Monotone priority queues in the quickest path problem |
| Authors: | Pilipchuk, L. A. Malahouskaja, Y. V. Pesheva, Y. H. |
| Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика |
| Issue Date: | 2002 |
| Citation: | Pilipchuk L.A. Monotone priority queues in the quickest path problem / L.A.Pilipchuk, Y.V. Malahouskaja, Y.H. Pesheva // Proceedings of the XXVII Summer School "Applications of Mathematics in Engineering and Economics". – Sofia. Heron Press. – 2002. – P. 377 – 384. |
| Abstract: | We use monotone priority queues in the quickest path problem. To the recalculation of the labels for the nodes we apply Dijkstra’s algorithm with heaps. |
| URI: | http://elib.bsu.by/handle/123456789/166735 |
| Appears in Collections: | Статьи факультета прикладной математики и информатики |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Статья2 from Network.pdf | 726,96 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.