Skip to main content
CoursebeginnerFree

Introduction to Graph Theory

Coursera

⏱ 5 weeks, 3-5 hours/week

We invite you to a fascinating journey into Graph Theory β€” an area which connects the elegance of painting and the rigor of mathematics; is simple, but not unsophisticated. Graph Theory gives us, both an easy way to pictorially represent many major mathematical results, and insights into the deep theories behind them. In this online course, among other intriguing applications, we will see how GPS systems find shortest routes, how engineers design integrated circuits, how biologists assemble genomes, why a political map can always be colored using a few colors. We will study Ramsey Theory which proves that in a large system, complete disorder is impossible! By the end of the course, we will implement an algorithm which finds an optimal assignment of students to schools. This algorithm, developed by David Gale and Lloyd S. Shapley, was later recognized by the conferral of Nobel Prize in Economics. As prerequisites we assume only basic math (e.g., we expect you to know what is a square or how to add fractions), basic programming in python (functions, loops, recursion), common sense and curiosity. Our intended audience are all people that work or plan to work in IT, starting from motivated high school students.

Visit resource

More resources on Network Flows

CourseFree

Design and Analysis of Algorithms

Master network flows with this Design and Analysis of Algorithms course by Tim Roughgarden. Learn key algorithms & boost your problem-solving skills!

CourseFree

Algorithms on Graphs

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 a 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 online 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.

WebsiteFree

mathworld.wolfram.com

MathWorld is an extensive online mathematics encyclopedia by Wolfram, offering detailed articles on a wide range of math topics with definitions, formulas, and references. It covers network flows and related algorithms, making it a solid resource for learning concepts, terminology, and context.

WebsiteFree

ocw.mit.edu

MIT OpenCourseWare is a free, openly accessible repository of MIT course materials, including lecture notes, assignments, exams, and syllabi, for self-paced study across disciplines. It hosts resources on topics such as network flows and other algorithms through downloadable course content.

BookFree

Network Flows: Theory, Algorithms, and Applications

Network Flows: Theory, Algorithms, and Applications - A book resource

WebsiteFree

nptel.ac.in

NPTEL (National Programme on Technology Enhanced Learning) is an Indian online learning platform offering free and paid courses with video lectures, notes, quizzes, and certificates across engineering and sciences. It includes content on optimization topics such as network flows, with course materials and lectures to help you learn the subject.

See all Network Flows resources β†’