{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","description":"A minimum spanning tree is a connected, cycle-free subgraph linking every vertex of a weighted graph with the lowest possible total edge weight.","display_name_alternatives":["minimum spanning trees","minimum weight spanning tree","shortest spanning tree","minimal spanning tree","minimum cost spanning tree","MST","SST"],"ids":{"openalex":"https://openalex.org/keywords/minimum-spanning-tree","wikidata":"https://www.wikidata.org/wiki/Q240464"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2139,"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.2139,"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":10993,"cited_by_count":187920,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/minimum-spanning-tree","updated_date":"2026-10-24T04:06:44","created_date":"2022-04-12T19:38:12"}