The state of the art in dynamic graph algorithms LNCS Henzinger, Monika H ; https://orcid.org/0000-0002-5008-6530 A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs. Springer Nature 2017 info:eu-repo/semantics/conferenceObject doc-type:ConferenceObject ConferenceObject http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/11772 Henzinger M. The state of the art in dynamic graph algorithms. In: <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>. Vol 10706. Springer Nature; 2017:40–44. doi:<a href="https://doi.org/10.1007/978-3-319-73117-9_3">10.1007/978-3-319-73117-9_3</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-73117-9_3 info:eu-repo/semantics/altIdentifier/issn/0302-9743 info:eu-repo/semantics/altIdentifier/isbn/9783319731162 info:eu-repo/semantics/altIdentifier/e-isbn/9783319731179 info:eu-repo/semantics/closedAccess