Minimum Spanning Tree (MST) Courses and Certifications

Algorithms, Part II

21 ratings

Explore advanced algorithms and data structures, focusing on graph and string processing. Learn efficient Java implementations and analyze their performance for real-world applications.

• Coursera
• 63 hours
• Self-Paced
• Paid Course

Hausdorff Center for Mathematics

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

Explore an O(1)-approximation algorithm for minimum spanning tree interdiction, improving upon previous O(log(m)) solutions. Learn about network interdiction and its applications in infrastructure protection.

• YouTube
• 51 minutes
• Self-Paced
• Free Video

Yacine Mahdid

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

Explore Orthogonalized Minimum Spanning Trees for brain connectivity analysis. Learn about data-driven thresholding methods, their application in human brain mapping, and practical implementation through code examples.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Algorithms on Graphs

2272 ratings at Coursera

Explore graph algorithms for optimal routes, network design, and social network analysis. Learn traversal techniques, shortest paths, and minimum spanning trees with real-world applications.

• Coursera
• 2 days 6 hours 37 minutes
• Self-Paced
• Paid Course

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

6 ratings

Explore advanced graph algorithms, pattern matching, and dynamic programming techniques. Gain practical skills in implementing efficient solutions for complex computational problems.

• edX
• 5 weeks, 9-10 hours/week
• Self-Paced
• Free Online Course (Audit)

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1276 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
• 14 hours 41 minutes
• Self-Paced
• Paid Course

Graph Algorithms

Learn how to use algorithms to explore graphs, compute shortest distance, min spanning tree, and connected components.

• edX
• 6 weeks, 8-10 hours/week
• Self-Paced
• Free Online Course (Audit)

Coding Train

Additional Topics in p5.js - JavaScript Functions, Transformations, and Advanced Concepts - Part 9

Explore advanced p5.js techniques including transformations, JavaScript closures, algorithms, and creative coding patterns for interactive visual programming.

• YouTube
• 5 hours 29 minutes
• Self-Paced
• Free Video

CodeHelp - by Babbar

Graph Data Structures and Algorithms - Complete Course

Master graph algorithms from basics to advanced topics including BFS, DFS, shortest paths, MST, and strongly connected components with hands-on C++ implementation.

• YouTube
• 7 hours 10 minutes
• Self-Paced
• Free Video

Mastering critical SKILLS in Algorithms using C++: Part 2

282 ratings at Udemy

70 Challenges to master recursive based techniques, shortest-path and MST algorithms.

• Udemy
• 15 hours 4 minutes
• Self-Paced
• Paid Course

Algorithmic Graph Theory and Data Structures

Master mathematical modeling and algorithmic analysis of graph problems through core algorithms, data structures, and complexity analysis for real-world applications.

• Swayam
• 12 weeks
• Self-Paced
• Free Online Course

NPTEL;  IIT Gandhinagar

Getting Started with Competitive Programming

Deepen your understanding of algorithmic techniques and prepare for coding competitions. Learn advanced sorting, greedy algorithms, graph theory, and dynamic programming through problem-solving and implementation.

• Swayam
• 12 weeks
• Self-Paced
• Free Online Course

Great Learning

Greedy Programming in Java

Learn greedy programming in Java, covering concepts, examples, and implementations of Fractional Knapsack and Prim's Algorithm for minimal spanning trees. Gain practical skills in solving optimization problems efficiently.

• YouTube
• 1 hour 9 minutes
• Self-Paced
• Free Video

Great Learning

Prim's Algorithm in Java

Learn Prim's Algorithm for finding minimal spanning trees using Java, covering greedy programming concepts and practical implementation with detailed explanations and code examples.

• YouTube
• 38 minutes
• Self-Paced
• Free Video

Simons Institute

A NASA Perspective on Quantum Computing - Recent Results in Distributed Computing

1 rating

Explore NASA's quantum computing research, focusing on distributed computing advancements in the quantum CONGEST-CLIQUE Model for optimization problems relevant to space missions.

• YouTube
• 34 minutes
• Self-Paced
• Free Video