{"id":"https://openalex.org/keywords/matroid-intersection","display_name":"matroid intersection","description":"A combinatorial optimization problem seeking a largest set independent in each of two given matroids.","display_name_alternatives":["matroid intersection problem"],"ids":{"openalex":"https://openalex.org/keywords/matroid-intersection","wikidata":"https://www.wikidata.org/wiki/Q6787903"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6849,"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.6849,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0798,"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":470,"cited_by_count":17703,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/matroid-intersection","updated_date":"2026-11-22T04:06:09","created_date":"2022-04-12T19:38:12"}
