Results
eNauka >
Results >
A new efficient algorithm for finding k shortest simple paths in undirected graphs
| Title: | A new efficient algorithm for finding k shortest simple paths in undirected graphs | Authors: | Rančić, Svetozar   |
Issue Date: | 2014 | Publication: | Book of Abstracts of 13th Serbian Mathematical Congress | Publisher: | Department of Mathematics and Informatics,Faculty of Sciences, University of Novi Sad, Srbija | Type: | Conference Paper | ISBN: | 978-86-6275-026-6  Search Idenfier |
Collation: | str. 125-125 | URI: | https://enauka.gov.rs/handle/123456789/299983 | URL: | http://tesla.pmf.ni.ac.rs/people/smak/book_of_abstracts.pdf | Metadata source: | Migrirano iz RIS podataka | M-category: | Mp. category will be shown later |
Google ScholarTM
Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.