{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T07:35:38Z","timestamp":1725435338325},"reference-count":3,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.23919\/fruct.2012.8122089","type":"proceedings-article","created":{"date-parts":[[2017,11,30]],"date-time":"2017-11-30T17:02:27Z","timestamp":1512061347000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Methodology of searching for all shortest routes in NoC"],"prefix":"10.23919","author":[{"given":"Nadezhda","family":"Matveeva","sequence":"first","affiliation":[]},{"given":"Elena","family":"Suvorova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/b105353"},{"journal-title":"Principles and Practices of Interconnection Network","year":"2004","author":"dally","key":"ref2"},{"journal-title":"Introduction to Algorithms","year":"2002","author":"cormen","key":"ref1"}],"event":{"name":"2012 12th Conference of Open Innovations Association (FRUCT) and Seminar on e-Travel","start":{"date-parts":[[2012,11,5]]},"location":"Oulu","end":{"date-parts":[[2012,11,9]]}},"container-title":["2012 12th Conference of Open Innovations Association (FRUCT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8114612\/8122076\/08122089.pdf?arnumber=8122089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T17:54:18Z","timestamp":1516038858000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8122089\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":3,"URL":"https:\/\/doi.org\/10.23919\/fruct.2012.8122089","relation":{},"subject":[],"published":{"date-parts":[[2012,11]]}}}