{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:23:06Z","timestamp":1780762986330,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,3]]},"DOI":"10.1145\/3019612.3019816","type":"proceedings-article","created":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T16:27:32Z","timestamp":1495729652000},"page":"1061-1067","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Incremental maximum flow computation on evolving networks"],"prefix":"10.1145","author":[{"given":"Sergio","family":"Greco","sequence":"first","affiliation":[{"name":"University of Calabria, Rende (CS) - Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cristian","family":"Molinaro","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende (CS) - Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chiara","family":"Pulice","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ximena","family":"Quintana","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende (CS) - Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Computer Vision Datasets. http:\/\/vision.csd.uwo.ca\/data\/.  Computer Vision Datasets. http:\/\/vision.csd.uwo.ca\/data\/."},{"key":"e_1_3_2_1_2_1","unstructured":"The Maximum Flow Project Benchmark. http:\/\/www.cs.tau.ac.il\/~sagihed\/ibfs\/benchmark.html.  The Maximum Flow Project Benchmark. http:\/\/www.cs.tau.ac.il\/~sagihed\/ibfs\/benchmark.html."},{"key":"e_1_3_2_1_3_1","volume-title":"Network flows - Theory, Algorithms and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network flows - Theory, Algorithms and Applications . Prentice Hall , 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows - Theory, Algorithms and Applications. Prentice Hall, 1993."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505883"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0572"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009180"},{"key":"e_1_3_2_1_8_1","first-page":"1277","article-title":"Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation","volume":"11","author":"Dinic E. A.","year":"1970","unstructured":"E. A. Dinic . Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation . Soviet Math Doklady , 11 : 1277 -- 1280 , 1970 . E. A. Dinic. Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation. Soviet Math Doklady, 11:1277--1280, 1970.","journal-title":"Soviet Math Doklady"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11554-013-0344-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347121"},{"key":"e_1_3_2_1_12_1","volume-title":"Flows in Networks","author":"Ford D. R.","year":"2010","unstructured":"D. R. Ford and D. R. Fulkerson . Flows in Networks . Princeton University Press , 2010 . D. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_39"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02158-9_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040623"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628036"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2949689.2949713"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2016.7752238"},{"key":"e_1_3_2_1_20_1","first-page":"1668","volume-title":"ECAI","author":"Greco S.","year":"2016","unstructured":"S. Greco and F. Parisi . Efficient computation of deterministic extensions for dynamic abstract argumentation frameworks . In ECAI , pages 1668 -- 1669 , 2016 . S. Greco and F. Parisi. Efficient computation of deterministic extensions for dynamic abstract argumentation frameworks. In ECAI, pages 1668--1669, 2016."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48758-8_19"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0524"},{"key":"e_1_3_2_1_23_1","volume-title":"Finding web communities by maximum flow algorithm using well-assigned edge capacities. IEICE Transactions, 87-D(2):407--415","author":"Imafuji N.","year":"2004","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 . 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":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.06.008"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.95"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1128"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244408.1244417"},{"key":"e_1_3_2_1_28_1","first-page":"15","volume-title":"NSDI","author":"Tran D. N.","year":"2009","unstructured":"D. N. Tran , B. Min , J. Li , and L. Subramanian . Sybil-resilient online content voting . In NSDI , pages 15 -- 28 , 2009 . D. N. Tran, B. Min, J. Li, and L. Subramanian. Sybil-resilient online content voting. In NSDI, pages 15--28, 2009."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159945"}],"event":{"name":"SAC 2017: Symposium on Applied Computing","location":"Marrakech Morocco","acronym":"SAC 2017","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3019612.3019816","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3019612.3019816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:45Z","timestamp":1750215825000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3019612.3019816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":29,"alternative-id":["10.1145\/3019612.3019816","10.1145\/3019612"],"URL":"https:\/\/doi.org\/10.1145\/3019612.3019816","relation":{},"subject":[],"published":{"date-parts":[[2017,4,3]]},"assertion":[{"value":"2017-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}