dynamic graph connectivity
Description: The algorithmic problem of maintaining information about whether vertices remain connected as edges in a graph are inserted or deleted.
Primary topic: Complexity and Algorithms in Graphs (63%)
Related topic: Complexity and Algorithms in Graphs (63%)
OpenAlex ID: keywords/dynamic-graph-connectivity
