{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:15:00Z","timestamp":1725592500208},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/stc-csit.2019.8929829","type":"proceedings-article","created":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T21:03:39Z","timestamp":1576184619000},"page":"165-168","source":"Crossref","is-referenced-by-count":0,"title":["Software modelling complex of network operating parameters with variable input data"],"prefix":"10.1109","author":[{"given":"Duda","family":"Oleksii","sequence":"first","affiliation":[]},{"given":"Martsenko","family":"Serhii","sequence":"additional","affiliation":[]},{"given":"Matsiuk","family":"Oleksandr","sequence":"additional","affiliation":[]},{"given":"Kunanets","family":"Nataliia","sequence":"additional","affiliation":[]},{"given":"Pasichnyk","family":"Volodymyr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Brilliant - Dijkstra's Shortest Path Algorithm","year":"0","key":"ref4"},{"journal-title":"JGraphT - Parent 1 3 0","year":"0","key":"ref3"},{"journal-title":"Baeldung - Dijkstra algorithm in Java","year":"0","key":"ref6"},{"key":"ref5","first-page":"155","author":"katib","year":"2011","journal-title":"IP\/MPLS over OTN over DWDM multilayer networks optimization models algorithms and analyses"},{"journal-title":"Deiksstra algorithm Search for the best routes on the graph","year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"ref1","first-page":"1071","author":"michaels","year":"1191","journal-title":"Applicatoin of Discrete Matchematics"}],"event":{"name":"2019 IEEE 14th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)","start":{"date-parts":[[2019,9,17]]},"location":"Lviv, Ukraine","end":{"date-parts":[[2019,9,20]]}},"container-title":["2019 IEEE 14th International Conference on Computer Sciences and Information Technologies (CSIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8910522\/8929738\/08929829.pdf?arnumber=8929829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T13:10:04Z","timestamp":1657977004000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8929829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/stc-csit.2019.8929829","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}