{"id":"https://openalex.org/keywords/spanning-tree-algorithms","display_name":"spanning tree algorithms","description":"Graph algorithms for finding a connected, cycle-free subgraph that includes every vertex, with applications in network analysis and optimization.","display_name_alternatives":["spanning tree algorithm","algorithms for spanning trees"],"ids":{"openalex":"https://openalex.org/keywords/spanning-tree-algorithms","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4036,"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.4036,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.0754,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":344,"cited_by_count":6021,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/spanning-tree-algorithms","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
