Minimum Spanning Tree (MST) Courses and Certifications

Yacine Mahdid

Orthogonalized Minimum Spanning Tree and Their Application for Human Brain Mapping - Paper Review

Explore brain connectivity graph thresholding with Yacine Mahdid's concise guide, featuring a data-driven method, OMST, and a code walkthrough. Less than 1-hour workload.

• YouTube
• 28 minutes
• On-Demand
• Free Online Course

Hausdorff Center for Mathematics

An O(1)-Approximation for Minimum Spanning Tree Interdiction

Explore network interdiction and graph optimization problems in this under 1-hour lecture by Rico Zenklusen, offered by the Hausdorff Center for Mathematics.

• YouTube
• 51 minutes
• On-Demand
• Free Online Course

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1250 ratings at Coursera

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

• Coursera
• 15 hours 29 minutes
• On-Demand
• Free Online Course (Audit)

Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms

4 reviews

Explore advanced data structures and algorithms with Georgia Tech's 5-week course. Learn graph algorithms, dynamic programming, pattern matching, and Java principles. Requires 9-10 hours weekly.

• edX
• 5 weeks, 9-10 hours a week
• On-Demand
• Free Online Course (Audit)

Spanning Tree and Link Aggregation

The third course in the ACSA certification path for Pluralsight introduces Spanning Tree Protocol and Link Aggregation.

• Pluralsight
• On-Demand
• Free Trial Available