{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T04:00:01Z","timestamp":1730260801185,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/icumt.2012.6459760","type":"proceedings-article","created":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T19:10:56Z","timestamp":1361473856000},"page":"725-730","source":"Crossref","is-referenced-by-count":0,"title":["Calculation of arc-disjoint trees in mixed-graph arbitrary mesh optical networks"],"prefix":"10.1109","author":[{"given":"Costas K.","family":"Constantinou","sequence":"first","affiliation":[]},{"given":"Georgios","family":"Ellinas","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033104"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.05.024"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ONDM.2012.6210280"},{"journal-title":"Introduction to the Theory of Graphs Allyn and Bacon","year":"1971","author":"behzad","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1364\/ECOC.2011.We.10.P1.88"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1364\/OE.19.00B471"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/35.747251"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811708"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/35.186364"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2005.12.002"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2003.819550"},{"key":"6","first-page":"573","article-title":"An approximate solution for the steiner problem in graphs","volume":"24","author":"takahashi","year":"1980","journal-title":"Math Japonica"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"4","first-page":"1958","author":"karp","year":"1972","journal-title":"Reducibility among Combinatorial Problems Complexity of Computer Computations"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/50.908667"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(02)00345-6"}],"event":{"name":"2012 IV International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT 2012)","start":{"date-parts":[[2012,10,3]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2012,10,5]]}},"container-title":["2012 IV International Congress on Ultra Modern Telecommunications and Control Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6449582\/6459638\/06459760.pdf?arnumber=6459760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T15:54:00Z","timestamp":1490198040000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6459760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icumt.2012.6459760","relation":{},"subject":[],"published":{"date-parts":[[2012,10]]}}}