{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T20:10:02Z","timestamp":1751227802510,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":17,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1145\/3041021.3051152","type":"proceedings-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T18:39:25Z","timestamp":1515695965000},"page":"1383-1385","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Maximum Flow Maintenance on Dynamic Networks"],"prefix":"10.1145","author":[{"given":"Sergio","family":"Greco","sequence":"first","affiliation":[{"name":"University of Calabria, Rende, Italy"}]},{"given":"Cristian","family":"Molinaro","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende, Italy"}]},{"given":"Chiara","family":"Pulice","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Ximena","family":"Quintana","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende, Italy"}]}],"member":"320","reference":[{"key":"key-10.1145\/3041021.3051152-1","doi-asserted-by":"crossref","unstructured":"Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell., 26(9):1124--1137, 2004.","DOI":"10.1109\/TPAMI.2004.60"},{"key":"key-10.1145\/3041021.3051152-2","doi-asserted-by":"crossref","unstructured":"M. Calautti, S. Greco, and I. Trubitsyna. Detecting decidable classes of finitely ground logic programs with function symbols. In PPDP, pages 239--250, 2013.","DOI":"10.1145\/2505879.2505883"},{"key":"key-10.1145\/3041021.3051152-3","doi-asserted-by":"crossref","unstructured":"B. V. Cherkassky and A. V. Goldberg. On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19(4):390--410, 1997.","DOI":"10.1007\/PL00009180"},{"key":"key-10.1145\/3041021.3051152-4","doi-asserted-by":"crossref","unstructured":"G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In KDD, pages 150--160, 2000.","DOI":"10.1145\/347090.347121"},{"key":"key-10.1145\/3041021.3051152-5","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg. The partial augment-relabel algorithm for the maximum flow problem. In ESA, pages 466--477, 2008.","DOI":"10.1007\/978-3-540-87744-8_39"},{"key":"key-10.1145\/3041021.3051152-6","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg. Two-level push-relabel algorithm for the maximum flow problem. In AAIM, pages 212--225, 2009.","DOI":"10.1007\/978-3-642-02158-9_19"},{"key":"key-10.1145\/3041021.3051152-7","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg, S. Hed, H. Kaplan, P. Kohli, R. E. Tarjan, and R. F. Werneck. Faster and more dynamic maximum flow by incremental breadth-first search. In ESA, pages 619--630, 2015.","DOI":"10.1007\/978-3-662-48350-3_52"},{"key":"key-10.1145\/3041021.3051152-8","doi-asserted-by":"crossref","unstructured":"S. Greco, C. Molinaro, and C. Pulice. Efficient maintenance of all-pairs shortest distances. In SSDBM, pages 9:1--9:12, 2016.","DOI":"10.1145\/2949689.2949713"},{"key":"key-10.1145\/3041021.3051152-9","doi-asserted-by":"crossref","unstructured":"S. Greco, C. Molinaro, C. Pulice, and X. Quintana. All-pairs shortest distances maintenance in relational DBMSs. In ASONAM, 2016.","DOI":"10.1109\/ASONAM.2016.7752238"},{"key":"key-10.1145\/3041021.3051152-10","doi-asserted-by":"crossref","unstructured":"S. Greco and F. Parisi. Efficient computation of deterministic extensions for dynamic abstract argumentation frameworks. In ECAI, pages 1668--1669, 2016.","DOI":"10.1007\/978-3-319-48758-8_19"},{"key":"key-10.1145\/3041021.3051152-11","doi-asserted-by":"crossref","unstructured":"S. Greco and F. Parisi. Incremental computation of deterministic extensions for dynamic argumentation frameworks. In JELIA, pages 288--304, 2016.","DOI":"10.1007\/978-3-319-48758-8_19"},{"key":"key-10.1145\/3041021.3051152-12","doi-asserted-by":"crossref","unstructured":"D. S. Hochbaum. The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research, 56(4):992--1009, 2008.","DOI":"10.1287\/opre.1080.0524"},{"key":"key-10.1145\/3041021.3051152-13","unstructured":"N. Imafuji and M. Kitsuregawa. Finding web communities by maximum flow algorithm using well-assigned edge capacities. IEICE Transactions, 87-D(2):407--415, 2004."},{"key":"key-10.1145\/3041021.3051152-14","doi-asserted-by":"crossref","unstructured":"C. Kang, S. Kraus, C. Molinaro, F. Spezzano, and V. S. Subrahmanian. Diffusion centrality: A paradigm to maximize spread in social networks. Artificial Intelligence, 239:70--96, 2016.","DOI":"10.1016\/j.artint.2016.06.008"},{"key":"key-10.1145\/3041021.3051152-15","doi-asserted-by":"crossref","unstructured":"C. Kang, C. Molinaro, S. Kraus, Y. Shavitt, and V. S. Subrahmanian. Diffusion centrality in social networks. In ASONAM, pages 558--564, 2012.","DOI":"10.1109\/ASONAM.2012.95"},{"key":"key-10.1145\/3041021.3051152-16","doi-asserted-by":"crossref","unstructured":"P. Kohli and P. H. S. Torr. Dynamic graph cuts for efficient inference in markov random fields. IEEE Trans. Pattern Anal. Mach. Intell., 29(12):2079--2088, 2007.","DOI":"10.1109\/TPAMI.2007.1128"},{"key":"key-10.1145\/3041021.3051152-17","doi-asserted-by":"crossref","unstructured":"H. Saito, M. Toyoda, M. Kitsuregawa, and K. Aihara. A large-scale study of link spam detection by graph algorithms. In AIRWeb, 2007.","DOI":"10.1145\/1244408.1244417"}],"event":{"number":"26","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '17 Companion","name":"the 26th International Conference","start":{"date-parts":[[2017,4,3]]},"location":"Perth, Australia","end":{"date-parts":[[2017,4,7]]}},"container-title":["Proceedings of the 26th International Conference on World Wide Web Companion - WWW '17 Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041021.3051152","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3051152&ftid=1865267&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T19:32:14Z","timestamp":1751225534000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3041021.3051152"}},"subtitle":[],"proceedings-subject":"World Wide Web Companion","short-title":[],"issued":{"date-parts":[[2017]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1145\/3041021.3051152","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}