minimum spanning tree problem
Description: An optimization problem that seeks a lowest-weight tree connecting every vertex of a weighted graph without cycles.
Primary topic: Complexity and Algorithms in Graphs (39%)
Wikidata ID: wiki/Q240464
OpenAlex ID: keywords/minimum-spanning-tree-problem
