{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:55:40Z","timestamp":1729641340732,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2004.1303156","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"163-170","source":"Crossref","is-referenced-by-count":11,"title":["Applying ant colony optimization to routing in optical multistage interconnection networks with limited crosstalk"],"prefix":"10.1109","author":[{"given":"A.K.","family":"Katangur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Akkaladevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yi Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.D.","family":"Fraser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/jpdc.1999.1595","article-title":"Permutation capability of optical multistage interconnection networks","volume":"60","author":"yang","year":"2000","journal-title":"Journal of Parallel and Distributed Computing (JPDC)"},{"key":"14","first-page":"33","article-title":"HEWN: A polynomial algorithm for CLIQUE problem","volume":"13","author":"zhijun","year":"1998","journal-title":"Comp Sci Technol"},{"journal-title":"Interconnection Networks for Multiprocessors and Multicomputers Theory and Practice","year":"1994","author":"varma","key":"11"},{"journal-title":"Graph Coloring Using Ant Algorithms","year":"0","author":"walkowiak","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600357"},{"key":"1","article-title":"An ant algorithm for the graph colouring problem","author":"comellas","year":"1998","journal-title":"ANTS'98 - From Ant Colonies to Artificial Ants First International Workshop on Ant Colony Optimization"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/90.944348"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096722"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2002.1016608"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/50.337500"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/35.747249"}],"event":{"name":"18th International Parallel and Distributed Processing Symposium, 2004.","location":"Santa Fe, NM, USA"},"container-title":["18th International Parallel and Distributed Processing Symposium, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9132\/28950\/01303156.pdf?arnumber=1303156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T07:57:43Z","timestamp":1497599863000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1303156\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2004.1303156","relation":{},"subject":[]}}