Live briefing
Everything about Minimum spanning tree
Least-weight tree connecting graph vertices
In graph theory, a minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Minimum spanning treeA 5-minute orientation
- Skim a recent paper: Minimum Spanning Tree Image Segmentation Model Based on New WeightsInfluential work since 2022
- Pick up a classic book: Linguistic structure predictionThe most-reprinted book on the subject
- Read the landmark paper: Sequential image segmentation based on minimum spanning tree representationCited 35 times
- Go sideways: Borůvka's algorithmA closely related topic
- Go sideways: Expected linear time MST algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Sequential image segmentation based on minimum spanning tree representation
Brain Tumor Segmentation Based on Minimum Spanning Tree
Parallel Regional Segmentation Method of High-Resolution Remote Sensing Image Based on Minimum Spanning Tree
Image segmentation based on the minimum spanning tree with a novel weight
New accelerated graph‐based method of image segmentation applying minimum spanning tree
Boundary-Aware Superpixel Segmentation Based on Minimum Spanning Tree
Improved Minimum Spanning Tree based Image Segmentation with Guided Matting
A MINIMUM SPANNING TREE BASED METHOD FOR UAV IMAGE SEGMENTATION
🆕 Influential since 2022
📚 Books worth reading
Linguistic structure predictionNoah A. Smith · 2011
Algorithm Design and ApplicationsMichael T. Goodrich, Roberto Tamassia · 2014
প্রোগ্রামিং কনটেস্টমোঃ মাহবুবুল হাসান · 2016
Computer Networks & Communications (NetCom)Nabendu Chaki · 2013
Awareness TechniquesWilliam Swygard · 1970
A TOUR OF THE WORLDMalik Mansab Khan, Muhammad Rafique Abdul Aziz · 2025
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Borůvka's algorithm Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not…
- Expected linear time MST algorithm The expected linear time MST algorithm is a randomized algorithm for computing the minimum spanning forest of a weighted graph with no isolated vertices…
- Prim's algorithm In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset…
- Distributed minimum spanning tree The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where…
- K-minimum spanning tree The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a subgraph…
- Parallel algorithms for minimum spanning trees In graph theory a minimum spanning tree (MST) T {\displaystyle T} of a graph G = ( V , E ) {\displaystyle G=(V,E)} with | V | = n {\displaystyle |V|=n}…
- Kruskal's algorithm Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree.…
- Spanning tree In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of…