Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/166736| Title: | Quickest path problem |
| Authors: | Pilipchuk, L. A. Pesheva, Y. H. |
| Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика |
| Issue Date: | 2002 |
| Citation: | Pilipchuk L.A. Quickest path problem / L.A. Pilipchuk, Y.H. Pesheva // Proceedings of the XXVII Summer School "Applications of Mathematics in Engineering and Economics". – Sofia. Heron Press. – 2002. – P. 385 – 391. |
| Abstract: | The quickest path problem of a given length k from node s to node t is considered. To solve this problem it is necessary to get a set of the prevailing paths for node t. |
| URI: | http://elib.bsu.by/handle/123456789/166736 |
| Appears in Collections: | Статьи факультета прикладной математики и информатики |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Статья3 from Network.pdf | 701,63 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.