Algorithms on Graphs

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it c

Created by: Alexander S. Kulikov

icon
Quality Score

Content Quality
/
Video Quality
/
Qualified Instructor
/
Course Pace
/
Course Depth & Coverage
/

Overall Score : 90 / 100

icon
Live Chat with CourseDuck's Co-Founder for Help

Need help deciding on a data structures and algorithms course? Or looking for more detail on Alexander S. Kulikov's Algorithms on Graphs? Feel free to chat below.
Join CourseDuck's Online Learning Discord Community

icon
Course Description

If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders in Facebook, you're going to work with graphs and algorithms on graphs.In this course, you will first learn what a graph is and what are some of the most important properties. Then you'll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will then talk about shortest paths algorithms - from the basic ones to those which open door for 1000000 times faster algorithms used in Google Maps and other navigational services. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project. We will finish with minimum spanning trees which are used to plan road, telephone and computer networks and also find applications in clustering and approximate algorithms.Do you have technical problems? Write to us: coursera@hse.ru

icon
Instructor Details

Alexander S. Kulikov

Alexander S. Kulikov is a research fellow at St. Petersburg Department of Steklov Mathematical Institute of the Russian Academy of Sciences and a visiting professor at University of California, San Diego. His scientific interests include algorithms for NP-hard problems and circuit complexity. In St. Petersburg, he runs Computer Science Club and Computer Science Center.

icon
Reviews

4.5

190 total reviews

5 star 4 star 3 star 2 star 1 star
% Complete
% Complete
% Complete
% Complete
% Complete

By Frank S on 19-Jan-19

Course instructors did not reply my questions on a discussion forum! I did not have any help from them, they are very passive.

By Quan Z on 16-Nov-18

This course was an exceptional installment to this Algorithms track. While the problems in this course required less creativity to answer than did those of the antecedent courses, they did test the student's ability to logically, cleanly, and efficiently apply the algorithms and ideas presented in lecture. As always, the instruction was stellar and every piece of pertinent information for answering all problems was included in the instructions. Excellent course.

By Hemant V R on 10-Oct-18

This course took a bit more time than previous courses of the specialisation. It taught me everything about basics of algorithms. The last week was optional but it was the best, toughest and the best week of the course. It taught about fast traversal of graph and that concept of contraction hierchies was awesome and mind messing too.

By Edward F on 28-Oct-18

This was a great journey. In this journey I learnt a lot. This is best course ever.

By vacous on 27-Jun-16

I can only give this two stars at most. The lecturers are just like reading the PPT without any heuristic teaching approaches. The assignments make me desperate, always show very poor feedback message -- "Wrong answer", even the cases failed because of performance issue. The starter files given from the assignment are inconsistent with the pdf description. It's so confusing.Couldn't get any help from forums.

By Ricardo O D l R on 7-Oct-18

The forums are dead and no support is provided by the instructors. They're just pocketing our money and doing bugger all.Besides that, it is a well-designed course with some easy and some more challenging assignments.

By Tianshu Z on 16-Nov-18

The course itself is wonderful. I liked the challenges provided in this a lot. The information is provided in very short, clear and full enough manner (all claims are proved and proved are great and very clean). There was only one thing that disappointed me a bit: on the last week I couldn't find the tasks description and had to download it somewhere from the Internet thankfully the forum's students.

By Jen P on 15-Mar-18

exceptional very nice course. But we need to religiously follow the videos and materials

By David N M on 7-Nov-18

Great explanation of basic graph algorithms (week 1-5). However content of week 6 gives more questions than answers and should be improved.

By Jorge A R on 20-Sep-18

Need more graphical illustrations with colors when explaiing complex details

By Hossam A on 4-Oct-18

Great Course to learn fundamentals of Graph Algorithms.

By Qing O on 19-Mar-18

The lecturers could have done a better job in presenting the contents. For some of them, the tone is always monotonous. Also regarding the Bellman Ford's algorithm, it would be more helpful if the lecturer discusses the impact of the sequence of the edges to the running time.