{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:08:45Z","timestamp":1742947725181,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493892"},{"type":"electronic","value":"9783662493908"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49390-8_24","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:17:15Z","timestamp":1457374635000},"page":"253-260","source":"Crossref","is-referenced-by-count":0,"title":["Sink Toward Source Algorithm Finding Maximal Flows on Extended Mixed Networks"],"prefix":"10.1007","author":[{"given":"Viet Tran","family":"Ngoc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung Hoang","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien Tran","family":"Quoc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh","family":"Le Manh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Hoang Thi","family":"Khanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Chien, T.Q.: The problem to find the maximum flow on the network. The research project on the Ministry level, B2005-16-34, Vietnam (2005)"},{"issue":"26","key":"24_CR2","first-page":"99","volume":"3","author":"TQ Chien","year":"2008","unstructured":"Chien, T.Q.: Weighted source-sink alternative algorithm. Univ. Danang-Vietnam J. Sci. Technol. 3(26), 99\u2013105 (2008)","journal-title":"Univ. Danang-Vietnam J. Sci. Technol."},{"key":"24_CR3","unstructured":"Chien, T.Q., Tue, N.M., Viet, T.N.: Shortest path algorithm on extended graphs. In: Proceedings of the 6th National Conference on Fundamental and Applied Information Technology Research (FAIR), Vietnam, pp. 522\u2013527 (2013)"},{"volume-title":"Transportation and traffic theory in the 21st Century","year":"2002","key":"24_CR4","unstructured":"Taylor, M.A.P. (ed.): Transportation and traffic theory in the 21st Century. Pergamon Press Amsterdam, The Netherlands (2002)"},{"key":"24_CR5","unstructured":"Johnson, E.L., Committee Chair, Nemhauser, G.L.: Shortest paths and multicommodity network flow (2003)"},{"key":"24_CR6","unstructured":"Ngoc, V.T., Quoc, C.T., Van, T.N.: Improving computing performance for algorithm finding maximal flows on extended mixed networks. J. Inf. Comput. Sci. 075\u2013080, England, UK (2015)"},{"key":"24_CR7","unstructured":"Trevisan, L.: Generalizations of the maximum flow problem. Stanford University-CS261: Optimization (2011)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Madry, A.: Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. Massachusetts Institute of Technology (2009)","DOI":"10.1145\/1806689.1806708"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49390-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:54:39Z","timestamp":1720788879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49390-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493892","9783662493908"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49390-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}