{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:52:38Z","timestamp":1775065958593,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/grc.2012.6468649","type":"proceedings-article","created":{"date-parts":[[2013,3,2]],"date-time":"2013-03-02T07:39:39Z","timestamp":1362209979000},"page":"651-656","source":"Crossref","is-referenced-by-count":12,"title":["Contracting community for computing maximum flow"],"prefix":"10.1109","author":[{"given":"Yanping","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xiansheng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Hua","sequence":"additional","affiliation":[]},{"given":"Shu","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009180"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21353"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288321"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"14","first-page":"511","article-title":"Fugui he, yanpin zhang, ling zhang","volume":"46","year":"2010","journal-title":"Journal of Nanjing University"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2005-10407-5"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2011.113"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"1","first-page":"1281","article-title":"Research on the maximum network flow problem","volume":"40","author":"zhang xianchao","year":"2003","journal-title":"Journal of Computer research and development"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.3.419"},{"key":"7","first-page":"112","article-title":"Algorithm for construction of maximal flows in networks with complexity of o(v2e1\/2)","volume":"7","author":"cherkassky","year":"1977","journal-title":"Operations Math Meth Sol Economic Proc"},{"key":"6","first-page":"434","article-title":"Determining the maximum flow in a network by the method of pre-flows","volume":"15","author":"karzanov","year":"1974","journal-title":"Soviet Math Dokl"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"4","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 Dokl"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.06.030"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"}],"event":{"name":"2012 IEEE International Conference on Granular Computing (GrC-2012)","location":"Hangzhou, China","start":{"date-parts":[[2012,8,11]]},"end":{"date-parts":[[2012,8,13]]}},"container-title":["2012 IEEE International Conference on Granular Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6459622\/6468554\/06468649.pdf?arnumber=6468649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:40:19Z","timestamp":1490218819000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6468649\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/grc.2012.6468649","relation":{},"subject":[],"published":{"date-parts":[[2012,8]]}}}