{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:30:19Z","timestamp":1649007019070},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/bf02973440","type":"journal-article","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T20:49:33Z","timestamp":1224017373000},"page":"787-790","source":"Crossref","is-referenced-by-count":0,"title":["Max-flow problem in undirected planar networks with node capacities being in NC"],"prefix":"10.1007","volume":"19","author":[{"given":"Xian-Chao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying-Yu","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guo-Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,11]]},"reference":[{"key":"BF02973440_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R K Ahujia","year":"1993","unstructured":"Ahujia R K, Magnanti T L, Orlin J B. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey, 1993."},{"issue":"3","key":"BF02973440_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1997.1538","volume":"55","author":"K Weihe","year":"1997","unstructured":"Weihe K. Maximum (s, t)-flows in planar network inO(|V|log|V|) time.J. Computer and System Sciences, 1997, 55(3): 3\u201323.","journal-title":"J. Computer and System Sciences"},{"issue":"4","key":"BF02973440_CR3","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A V Goldberg","year":"1988","unstructured":"Goldberg A V, Tarjan R E. A new approach to the maximum flow problem.J. Assoc. Comput. Mach., 1988, 35(4): 921\u2013940.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02973440_CR4","doi-asserted-by":"crossref","unstructured":"Goldberg A V. Recent developments in maximum flow algorithms (Invited Lecture). InProc. Sixth Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 1998, pp.1\u20136.","DOI":"10.1007\/BFb0054350"},{"issue":"4","key":"BF02973440_CR5","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/31846.31849","volume":"34","author":"D B Johnson","year":"1987","unstructured":"Johnson D B. Parallel algorithms for minumum cuts and maximum flows in planar networks.J. Assoc. Comput. Mach., 1987, 34(4): 950\u2013967.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"BF02973440_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","volume":"21","author":"L M Goldschlager","year":"1982","unstructured":"Goldschlager L M, Shaw R, Staples J. The maximum flow problem is log space complete.Theoretical Computer Science, 1982, 21(1): 105\u2013111.","journal-title":"Theoretical Computer Science"},{"key":"BF02973440_CR7","volume-title":"Graph Theory with Applications","author":"J A Bondy","year":"1977","unstructured":"Bondy J A, Murty U S R. Graph Theory with Applications. North-Holland, Amsterdam, 1977."},{"key":"BF02973440_CR8","volume-title":"Study on algorithms for the maximum network flow problem [dissertation]","author":"X C Zhang","year":"2001","unstructured":"Zhang X C. Study on algorithms for the maximum network flow problem [dissertation]. University of Science and Technology of China, Hefei, China, 2001. (in Chinese)"},{"key":"BF02973440_CR9","volume-title":"Design and Analysis of Parallel Algorithms","author":"G L Chen","year":"1994","unstructured":"Chen G L. Design and Analysis of Parallel Algorithms. Higher, Education Publishing House, Beijing, China, 1994. (in Chinese)"},{"issue":"5","key":"BF02973440_CR10","first-page":"885","volume":"14","author":"X C Zhang","year":"2003","unstructured":"Zhang X C, Wan Y Y, Chen G L. Approaches to the minimum cut problem in a class of practical networks.Journal of Software, 2003, 14(5): 885\u2013890. (in Chinese)","journal-title":"Journal of Software"},{"issue":"9","key":"BF02973440_CR11","first-page":"1","volume":"32","author":"G L Chen","year":"1995","unstructured":"Chen G L, Liang W F, Shen H. Research advances in parallel graph algorithms.Computer Research and Development, 1995, 32(9): 1\u201316. (in Chinese)","journal-title":"Computer Research and Development"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973440.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02973440\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:31:30Z","timestamp":1558567890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02973440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["BF02973440"],"URL":"https:\/\/doi.org\/10.1007\/bf02973440","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}