{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:25:34Z","timestamp":1775579134777,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"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":[[2010,4]]},"DOI":"10.1109\/tit.2010.2040859","type":"journal-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T19:51:52Z","timestamp":1269460312000},"page":"1909-1929","source":"Crossref","is-referenced-by-count":10,"title":["Pruning Network Coding Traffic by Network Coding\u2014A New Class of Max-Flow Algorithms"],"prefix":"10.1109","volume":"56","author":[{"given":"Chih-Chun","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4310\/CIS.2006.v6.n1.a2","article-title":"network error correction, part i: basic concepts and upper bounds","volume":"6","author":"yeung","year":"2006","journal-title":"Commun Inf Syst"},{"key":"ref33","article-title":"distributed utility maximization for network coding based multicasting: a critical cut approach","author":"wu","year":"2006","journal-title":"Proc 2nd Workshop Network Coding Theory Appl"},{"key":"ref32","article-title":"beyond the butterflya graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions","author":"wang","year":"2007","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062235"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref37","article-title":"distributed algorithms for minimum cost multicast with network coding in wireless networks","author":"xi","year":"2006","journal-title":"Proc 3rd Int Symp Modeling and Optimization in Mobile Ad Hoc Wireless Netw"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879356"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.837362"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.857148"},{"key":"ref10","author":"goldberg","year":"1998","journal-title":"Recent developments in maximum flow algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523691"},{"key":"ref13","article-title":"distributed asynchronous algorithms for multicast network coding","author":"ho","year":"2005","journal-title":"Proc 1st Workshop on Netw Coding Theory and Appl Riva del Garda"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009809"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITWITWN.2007.4318023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.293"},{"key":"ref4","article-title":"distributed optimization in wireless networks using broadcast advantage","author":"cui","year":"2007","journal-title":"Proc 46th IEEE Conf Decision Contr"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"ref3","article-title":"practical network coding","author":"chou","year":"2003","journal-title":"Proc Ann Allerton Conf Commun Control and Computing"},{"key":"ref6","article-title":"a network coding approach to network monitoring","author":"fragouli","year":"2005","journal-title":"Proc Ann Allerton Conf Comm Cont and Computing"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090613"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2007.4298308"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"ref7","article-title":"topology inference using network coding","author":"fragouli","year":"2006","journal-title":"Proc Ann Allerton Conf Comm Cont and Computing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282400"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.78"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874542"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref22","article-title":"efficient and distributed computation of maximum multicast rates","author":"li","year":"2005","journal-title":"Proc IEEE Conf Computer Communications (INFOCOM)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.875032"},{"key":"ref23","article-title":"on achieving optimal throughput with network coding","author":"li","year":"2005","journal-title":"Proc IEEE Conf Computer Communications (INFOCOM)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITWITWN.2007.4318068"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879351"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5437371\/05437448.pdf?arnumber=5437448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T06:06:01Z","timestamp":1685513161000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5437448\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":38,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2040859","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}