Coursera | Online Courses & Credentials From Top Educators. Join for Free | Coursera

Completed by Matias Jose Agelvis Dominguez

November 22, 2019

15 hours (approximately)

Matias Jose Agelvis Dominguez's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Stanford University

4.8 (1,250 ratings)

|

76K Students Enrolled

Enroll for Free

Skills you will gain

Spanning Tree
Algorithms
Dynamic Programming
Greedy Algorithm

View certificate for Matias Jose Agelvis Dominguez, Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, an online non-credit course authorized by Stanford University and offered through Coursera