Abstract:
Finding shortest paths in a weighted graph is a fundamental and well studied problem in computer science. Such a problem arises in practice in different application settings.
Keywords:
DOI:
Issue
Pages:
89-103
File:
nepomniaschaya_snytnikova.pdf
(260.9 KB)