{"id":"https://openalex.org/keywords/spanning-tree-problem","display_name":"spanning tree problem","description":"A graph optimization problem concerned with finding a connected, cycle-free subgraph that includes every vertex and satisfies specified objectives.","display_name_alternatives":["spanning tree problems"],"ids":{"openalex":"https://openalex.org/keywords/spanning-tree-problem","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5402,"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.5402,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.1752,"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":247,"cited_by_count":2304,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/spanning-tree-problem","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
