{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:44:19Z","timestamp":1729629859621,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/icnc.2012.6234734","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T19:43:57Z","timestamp":1342727037000},"page":"1016-1018","source":"Crossref","is-referenced-by-count":0,"title":["An improved algorithm for solving maximum flow problem"],"prefix":"10.1109","author":[{"given":"Lifeng","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Xiaowan","family":"Meng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"2357","article-title":"New algorithm for solving network maximumflow problem","volume":"30","author":"wang","year":"2009","journal-title":"Computer Engineering and Design"},{"journal-title":"Net-work Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"2"},{"key":"10","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"dinic","year":"1970","journal-title":"Soviet Math Doklady"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","author":"bondy","year":"1976","journal-title":"Graph Theory with Applications"},{"key":"7","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"karzonov","year":"1974","journal-title":"Soviet Math Doklady"},{"key":"6","first-page":"37","article-title":"An algorithm for solving the problem of maximum flow in the transportation network","volume":"4","author":"xie","year":"2004","journal-title":"Operations Reseach and Management Science"},{"key":"5","first-page":"714","article-title":"Network maximum flow 2F algorithm with tolerance","volume":"6","author":"chen","year":"2008","journal-title":"Journal of Changchun Univerity of Techonogy"},{"key":"4","first-page":"131","article-title":"A distributed algorithm for the maximum flow problem","author":"pham","year":"2006","journal-title":"The 4th International Symposium on Parallel and Distributed Computing"},{"journal-title":"Ten Applications of Graph Theory","year":"2007","author":"walther","key":"9"},{"journal-title":"Introduction to Graph Theory","year":"0","author":"wilson","key":"8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1002\/net.20121"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9225-x"}],"event":{"name":"2012 8th International Conference on Natural Computation (ICNC)","start":{"date-parts":[[2012,5,29]]},"location":"Chongqing, Sichuan, China","end":{"date-parts":[[2012,5,31]]}},"container-title":["2012 8th International Conference on Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6227653\/6234502\/06234734.pdf?arnumber=6234734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:37:56Z","timestamp":1497980276000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6234734\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icnc.2012.6234734","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}