{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:13Z","timestamp":1772283613750,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/tit.2013.2262492","type":"journal-article","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T21:15:06Z","timestamp":1377724506000},"page":"5692-5707","source":"Crossref","is-referenced-by-count":5,"title":["The Complexity of Network Coding With Two Unit-Rate Multicast Sessions"],"prefix":"10.1109","volume":"59","author":[{"family":"Wentu Song","sequence":"first","affiliation":[]},{"family":"Kai Cai","sequence":"additional","affiliation":[]},{"family":"Rongquan Feng","sequence":"additional","affiliation":[]},{"family":"Chau Yuen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262046"},{"key":"ref11","article-title":"Complexity classification of network information flow problems","author":"lehman","year":"2003","journal-title":"41st Annu Allerton Conf Communication Control and Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref14","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"ACM-SIAM Symp Discrete Algorithms"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834751"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874434"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523641"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.476237"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050932"},{"key":"ref27","author":"bondy","year":"1979","journal-title":"Graph Theory with Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCAS.2004.1345934"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"2373","DOI":"10.1109\/TIT.2006.874432","article-title":"An outer bound for multisourc multi sink network coding with minimum cost consideration","volume":"52","author":"yan","year":"2006","journal-title":"IEEE Trans Inform Theory"},{"key":"ref29","article-title":"Network coding for 2-unicast with rate (1,2)","author":"song","year":"0","journal-title":"ISIT 2012 MIT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557213"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-9019-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261656"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034008"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978909"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033938"},{"key":"ref24","article-title":"Network coding as a coloring problem","author":"fragouli","year":"2004","journal-title":"Proc Conf Inform Sciences Syst"},{"key":"ref23","article-title":"Solving the single rate 2-pair network coding problem with the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$ {\\cal A}$<\/tex><\/formula> -set equation","author":"cai","year":"2011","journal-title":"NetCod"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1561\/0100000007","author":"yeung","year":"2006","journal-title":"Network Coding Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094930"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6579681\/06515150.pdf?arnumber=6515150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:47Z","timestamp":1638218867000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6515150\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":29,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2262492","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}