{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"blossom algorithm","description":"A graph algorithm that finds maximum matchings by contracting odd cycles, or blossoms, during the search for augmenting paths.","display_name_alternatives":["Edmonds's matching algorithm","Edmonds' matching algorithm","Edmonds's blossom algorithm","Edmonds' blossom algorithm","blossom matching algorithm"],"ids":{"openalex":"https://openalex.org/keywords/blossom-algorithm","wikidata":"https://www.wikidata.org/wiki/Q1030529"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4197,"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.4197,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.1378,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":94,"cited_by_count":3608,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/blossom-algorithm","updated_date":"2026-11-16T04:05:30","created_date":"2022-04-12T19:38:12"}
