{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:20:05Z","timestamp":1761744005119},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"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":[[2014,9]]},"DOI":"10.1109\/tit.2014.2336836","type":"journal-article","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T19:23:47Z","timestamp":1408044227000},"page":"5375-5386","source":"Crossref","is-referenced-by-count":2,"title":["A Graph Minor Perspective to Multicast Network Coding"],"prefix":"10.1109","volume":"60","author":[{"given":"Xunrui","family":"Yin","sequence":"first","affiliation":[]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiangyang","family":"Xue","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523639"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"232","DOI":"10.37236\/719","article-title":"Disproof of the list hadwiger conjecture","volume":"18","author":"bar\u00e1t","year":"2011","journal-title":"Electron J Combinat"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(80)80001-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228384"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/777463.777464"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283068"},{"key":"ref18","first-page":"91","article-title":"Edge-disjoint branchings","author":"edmonds","year":"1973","journal-title":"Combinatorial Algorithms"},{"key":"ref19","first-page":"325","article-title":"On benefits of network coding in bidirected networks and hyper-networks","author":"yin","year":"2012","journal-title":"Proc IEEE Inf Commun (INFOCOM)"},{"key":"ref28","first-page":"105","article-title":"Dynamic programming on graphs with bounded treewidth","volume":"317","author":"fiala","year":"1988","journal-title":"Automata Languages and Programming"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1592"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref6","author":"diestel","year":"1997","journal-title":"Graph Theory"},{"key":"ref29","author":"bang-jensen","year":"2008","journal-title":"Digraphs Theory Algorithms and Applications"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570828"},{"key":"ref8","first-page":"307","article-title":"Network coding in minimal multicast networks","author":"rouayheb","year":"2006","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282416"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011516"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173720"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","first-page":"1","article-title":"Can network coding help in P2P networks?","author":"chiu","year":"2006","journal-title":"Proc 4th Int Symp Model Optim Mobile Ad Hoc Wireless Netw"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090227"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579141"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202354"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874434"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874433"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6878505\/06850047.pdf?arnumber=6850047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:50:28Z","timestamp":1642006228000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6850047\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":30,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2336836","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}