# Algorithms and Hardness for Diameter in Dynamic Graphs.

> Research article (DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 2019) · cited 15× · AI/ML

**Wikidata**: [openalex:W2965078897](https://www.wikidata.org/wiki/openalex:W2965078897)  
**Source**: https://4ort.xyz/entity/algorithms-and-hardness-for-diameter-in-dynamic-graphs