{"id":"https://openalex.org/keywords/connected-subgraphs","display_name":"connected subgraphs","description":"Subgraphs in graph theory in which every pair of vertices is joined by a path using edges within the subgraph.","display_name_alternatives":["connected subgraph"],"ids":{"openalex":"https://openalex.org/keywords/connected-subgraphs","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.2544,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2544,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1572,"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":493,"cited_by_count":6891,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/connected-subgraphs","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
