Computational problems in graph theory | Network theory | Polynomial-time problems | Graph distance

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment. (Wikipedia).

Find the Shortest Path - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Longest Simple Path - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

The Shortest Distance Between A and B, with Two Reflections.

We present the solution to the shortest path problem between two given points with the constraint that the path needs to touch both x-axis and y-axis. A related problem is the Heron's shortest path problem. We give an visual animation of the problem and high level proof ideas. Both types

From playlist Geometry Problems for AMC Prep

Graph Theory: 20. Edge Weighted Shortest Path Problem

This video explains the problem known as the edge-weighted shortest path problem. The next two videos look at an algorithm which provides a solution to the problem. --An introduction to Graph Theory by Dr. Sarada Herke. For quick videos about Math tips and useful facts, check out my othe

From playlist Graph Theory part-4

Find the Shortest Path - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm

This is the fourth in a series of computer science videos about the graph data structure. This is an explanation of Dijkstra’s algorithm for finding the shortest path between one vertex in a graph and another. Indeed, this explains how Dijkstra’s shortest path algorithm generates a set o

From playlist Path Finding Algorithms

Longest Simple Path - Intro to Algorithms

From playlist Introduction to Algorithms

Single Source Shortest Paths - Intro to Algorithms

From playlist Introduction to Algorithms

MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Jason Ku View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This lecture discusses weighted graphs and weighted paths. This prepares

From playlist MIT 6.006 Introduction to Algorithms, Spring 2020

Lecture 15 - All-Pairs Shortest Paths

This is Lecture 15 of the CSE373 (Analysis of Algorithms) taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 1997. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/1997/lecture19.pdf

From playlist CSE373 - Analysis of Algorithms - 1997 SBU

Lecture 16 - Combinatorial Search

This is Lecture 16 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2007. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/2007/lecture15.pdf More informa

From playlist CSE373 - Analysis of Algorithms - 2007 SBU

MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Jason Ku View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This lecture focuses on solving any all-pairs shortest paths (APSP) in w

From playlist MIT 6.006 Introduction to Algorithms, Spring 2020

Single Source Shortest Paths - Intro to Algorithms

From playlist Introduction to Algorithms

This is Lecture 15 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www3.cs.stonybrook.edu/~skiena/] at Stony Brook University in 2016. The lecture slides are available at: https://www.cs.stonybrook.edu/~skiena/373/newlectures/lecture14.pdf More inf

From playlist CSE373 - Analysis of Algorithms 2016 SBU

Jeff Erickson - Lecture 4 - Two-dimensional computational topology - 21/06/18

School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (http://geomschool2018.univ-mlv.fr/) Jeff Erickson (University of Illinois at Urbana-Champaign, USA) Two-dimensional computational topology - Lecture 4 Abstract: This series of lectures will describe recent

From playlist Jeff Erickson - School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects

CSE 373 - Lecture 15, Fall 2020

From playlist CSE 373 -- Fall 2020

The Shortest Way Home- An Unexpected Result

A story about how I stumbled on a very surprising result on my way home. Apparently math isn't entirely useless! Sorry about the sound :(

From playlist Some fun math videos about approximation

Jeff Erickson - Lecture 3 - Two-dimensional computational topology - 20/06/18

School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (http://geomschool2018.univ-mlv.fr/) Jeff Erickson (University of Illinois at Urbana-Champaign, USA) Two-dimensional computational topology - Lecture 3 Abstract: This series of lectures will describe recent

From playlist Jeff Erickson - School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects