{"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"}],"day":"22","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783319731179"],"isbn":["9783319731162"]},"alternative_title":["LNCS"],"extern":"1","page":"40–44","citation":{"ista":"Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.","ieee":"M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, 2017, vol. 10706, pp. 40–44.","chicago":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” In 44th International Conference on Current Trends in Theory and Practice of Computer Science, 10706:40–44. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-73117-9_3.","short":"M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.","ama":"Henzinger MH. The state of the art in dynamic graph algorithms. In: 44th International Conference on Current Trends in Theory and Practice of Computer Science. Vol 10706. Springer Nature; 2017:40–44. doi:10.1007/978-3-319-73117-9_3","apa":"Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In 44th International Conference on Current Trends in Theory and Practice of Computer Science (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. https://doi.org/10.1007/978-3-319-73117-9_3","mla":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” 44th International Conference on Current Trends in Theory and Practice of Computer Science, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:10.1007/978-3-319-73117-9_3."},"volume":10706,"_id":"11772","abstract":[{"text":"A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs.","lang":"eng"}],"publisher":"Springer Nature","language":[{"iso":"eng"}],"date_published":"2017-12-22T00:00:00Z","scopus_import":"1","title":"The state of the art in dynamic graph algorithms","publication_status":"published","status":"public","month":"12","oa_version":"None","date_updated":"2023-02-10T08:36:03Z","doi":"10.1007/978-3-319-73117-9_3","quality_controlled":"1","intvolume":" 10706","article_processing_charge":"No","date_created":"2022-08-08T13:16:37Z","conference":{"end_date":"2018-02-02","name":"SOFSEM: Theory and Practice of Computer Science","start_date":"2018-01-29","location":"Krems, Austria"},"publication":"44th International Conference on Current Trends in Theory and Practice of Computer Science","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017"}