{"id":"https://openalex.org/keywords/maximum-common-subgraph","display_name":"maximum common subgraph","description":"A maximum common subgraph is a largest subgraph shared by two or more graphs, a problem studied in graph theory and computing.","display_name_alternatives":["largest common subgraph","maximum common subgraphs","MCS"],"ids":{"openalex":"https://openalex.org/keywords/maximum-common-subgraph","wikidata":"https://www.wikidata.org/wiki/Q115927373"},"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.4665,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.4665,"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/T10211","display_name":"Computational Drug Discovery Methods","score":0.0965,"subfield":{"id":"https://openalex.org/subfields/3002","display_name":"Drug Discovery"},"field":{"id":"https://openalex.org/fields/30","display_name":"Pharmacology, Toxicology and Pharmaceutics"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"works_count":281,"cited_by_count":5355,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/maximum-common-subgraph","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
