{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:13:22Z","timestamp":1743041602524,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030005566"},{"type":"electronic","value":"9783030005573"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00557-3_27","type":"book-chapter","created":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T23:44:26Z","timestamp":1539301466000},"page":"265-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Network Coding Optimization Algorithm for Reducing Encoding Nodes"],"prefix":"10.1007","author":[{"given":"Limin","family":"Meng","sequence":"first","affiliation":[]},{"given":"Yangtianxiu","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,12]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., et al.: Network information flow. IEEE Trans. Inf. Theory 46, 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"15","key":"27_CR2","first-page":"116","volume":"47","author":"JX Hu","year":"2011","unstructured":"Hu, J.X., Liu, S.Y.: Improved multicast network coding algorithm. Comput. Eng. Appl. 47(15), 116\u2013118 (2011)","journal-title":"Comput. Eng. Appl."},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Yeung, R.W., Li, S.Y.R., Cai, N., et.al.: Network Coding Theory. Now Publishers Inc. (2006)","DOI":"10.1561\/0100000007"},{"issue":"5","key":"27_CR5","first-page":"1","volume":"36","author":"SG Tao","year":"2008","unstructured":"Tao, S.G., Huang, J.Q., Yang, Z.K., et al.: An improved algorithm for minimal cost network coding. Huazhong Univ. Sci. Tech. (Natural Sci. Edit.) 36(5), 1\u20134 (2008)","journal-title":"Huazhong Univ. Sci. Tech. (Natural Sci. Edit.)"},{"key":"27_CR6","first-page":"1277","volume":"11","author":"D Yefim","year":"1970","unstructured":"Yefim, D.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Dokl. Akad. Nauk SSSR 11, 1277\u20131280 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"27_CR7","unstructured":"Liu, J.F., Zhou, J.: Minimize coding node algorithm based on polynomial time algorithms. In: The 23rd National Conference on New Computer Science and Technology and Computer Education (2012)"},{"issue":"6","key":"27_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"6","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S Jaggi","year":"2005","unstructured":"Jaggi, S., Sanders, P., Chou, P.A., et al.: Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory 51(6), 1973\u20131982 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR10","unstructured":"Zhu, Y.Y., Cao, Z., Zhu, L.X.: An improved encoding nodes reduction algorithm for network. Electron. Electro\u2014opt. Syst. 3, 47\u201352 (2012)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"27_CR12","volume-title":"Graph algorithm and its MATLAB implementation","author":"HY Wang","year":"2010","unstructured":"Wang, H.Y., Huang, Q., Li, C.T., et al.: Graph algorithm and its MATLAB implementation. Beijing University of Aeronautics and Astronautics Press, Beijing (2010)"},{"issue":"9","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617\u20131622 (1988)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Machine Learning and Intelligent Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00557-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T09:08:14Z","timestamp":1588151294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00557-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030005566","9783030005573"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00557-3_27","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MLICOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning and Intelligent Communications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mlicom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mlicom.org\/2018\/show\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}