{"id":"https://openalex.org/keywords/dynamic-graph-connectivity","display_name":"dynamic graph connectivity","description":"The algorithmic problem of maintaining information about whether vertices remain connected as edges in a graph are inserted or deleted.","display_name_alternatives":["dynamic graph connectivity problem","connectivity in dynamic graphs"],"ids":{"openalex":"https://openalex.org/keywords/dynamic-graph-connectivity","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6269,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6269,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":112,"cited_by_count":2282,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/dynamic-graph-connectivity","updated_date":"2026-11-21T04:06:33","created_date":"2026-09-30T00:00:00"}
