{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:29Z","timestamp":1792111469715,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":16,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_425","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:32:23Z","timestamp":1553095943000},"page":"2242-2246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Trade-Offs for Dynamic Graph Problems"],"prefix":"10.1007","author":[{"given":"Camil","family":"Demetrescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"425_CR20207","volume-title":"Network flows: theory, algorithms and applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja R, Magnanti T, Orlin J (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs"},{"key":"425_CR20208","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith D, Winograd S (1990) Matrix multiplication via arithmetic progressions. J Symb Comput 9:251\u2013280","journal-title":"J Symb Comput"},{"key":"425_CR20209","volume-title":"Handbook on data structures and applications. CRC Press series, in computer and information science, chap. 36","author":"C Demetrescu","year":"2005","unstructured":"Demetrescu C, Finocchi I, Italiano G (2005) Dynamic graphs. In: Mehta D, Sahni S (eds) Handbook on data structures and applications. CRC Press series, in computer and information science, chap. 36. CRC, Boca Raton"},{"key":"425_CR20210","doi-asserted-by":"crossref","unstructured":"Demetrescu C, Italiano G (2000) Fully dynamic transitive closure: breaking through the O(n2) barrier. In: Proceedings of the 41st IEEE annual symposium on foundations of computer science (FOCS'00), Redondo Beach, pp 381\u2013389","DOI":"10.1109\/SFCS.2000.892126"},{"key":"425_CR20211","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1059513.1059514","volume":"52","author":"C Demetrescu","year":"2005","unstructured":"Demetrescu C, Italiano G (2005) Trade-offs for fully dynamic reachability on dags: breaking through the O(n2) barrier. J ACM 52:147\u2013156","journal-title":"J ACM"},{"key":"425_CR20212","doi-asserted-by":"crossref","unstructured":"Henzinger M, King V (1995) Fully dynamic biconnectivity and transitive closure. In: Proceedings of the 36th IEEE symposium on foundations of computer science (FOCS'95), Milwaukee, pp 664\u2013672","DOI":"10.1109\/SFCS.1995.492668"},{"key":"425_CR20213","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/jcom.1998.0476","volume":"14","author":"X Huang","year":"1998","unstructured":"Huang X, Pan V (1998) Fast rectangular matrix multiplication and applications. J Complex 14:257\u2013299","journal-title":"J Complex"},{"key":"425_CR20214","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1002\/spe.4380111102","volume":"11","author":"D Knuth","year":"1981","unstructured":"Knuth D, Plass M (1981) Breaking paragraphs into lines. Softw Pract Exp 11:1119\u20131184","journal-title":"Softw Pract Exp"},{"key":"425_CR20215","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0028290","volume-title":"Bounded incremental computation","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam G (1996) Bounded incremental computation. Lecture notes in computer science, vol 1089. Springer, New York"},{"key":"425_CR20216","doi-asserted-by":"crossref","unstructured":"Roditty L, Zwick U (2002) Improved dynamic reachability algorithms for directed graphs. In: Proceedings of 43th annual IEEE symposium on foundations of computer science (FOCS), Vancouver, pp 679\u2013688","DOI":"10.1109\/SFCS.2002.1181993"},{"key":"425_CR20217","doi-asserted-by":"crossref","unstructured":"Roditty L, Zwick U (2004) A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proceedings of the 36th annual ACM symposium on theory of computing (STOC), Chicago, pp 184\u2013191","DOI":"10.1145\/1007352.1007387"},{"key":"425_CR20218","doi-asserted-by":"crossref","unstructured":"Roditty L, Zwick U (2004) On dynamic shortest paths problems. In: Proceedings of the 12th annual European symposium on algorithms (ESA), Bergen, pp 580\u2013591","DOI":"10.1007\/978-3-540-30140-0_52"},{"key":"425_CR20219","doi-asserted-by":"crossref","unstructured":"Sankowski P (2004) Dynamic transitive closure via dynamic matrix inverse. In: FOCS '04: proceedings of the 45th annual IEEE symposium on foundations of computer science (FOCS'04). IEEE Computer Society, Washington, DC, pp 509\u2013517","DOI":"10.1109\/FOCS.2004.25"},{"key":"425_CR20220","doi-asserted-by":"crossref","unstructured":"Sankowski P (2005) Subquadratic algorithm for dynamic shortest distances. In: 11th annual international conference on computing and combinatorics (COCOON'05), Kunming, pp 461\u2013470","DOI":"10.1007\/11533719_47"},{"key":"425_CR20221","doi-asserted-by":"crossref","unstructured":"Schulz F, Wagner D, Weihe K (1999) Dijkstra's algorithm on-line: an empirical case study from public railroad transport. In: Proceedings of the 3rd workshop on algorithm engineering (WAE'99), London, pp 110\u2013123","DOI":"10.1007\/3-540-48318-7_11"},{"key":"425_CR20222","doi-asserted-by":"crossref","unstructured":"Yannakakis M (1990) Graph-theoretic methods in database theory. In: Proceedings of the 9-th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Nashville, pp 230\u2013242","DOI":"10.1145\/298514.298576"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:52:24Z","timestamp":1792108344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_425","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}