YoVDO

Parametric Shortest Paths in Planar Graphs

Offered By: IEEE via YouTube

Tags

Graph Theory Courses Computer Science Courses Mathematics Courses Algorithmic Complexity Courses Shortest Path Algorithms Courses Planar Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 21-minute IEEE conference talk on parametric shortest paths in planar graphs, presented by Kshitij Gajjar and Jaikumar Radhakrishnan. Delve into the intricacies of graph theory and algorithmic approaches for solving shortest path problems in planar graphs with parametric edge weights. Gain insights into the latest research and advancements in this specialized area of computer science and mathematics.

Syllabus

Parametric Shortest Paths in Planar Graphs


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Unordered Data Structures
University of Illinois at Urbana-Champaign via Coursera Determine Shortest Paths Between Routers Using Python
Coursera Project Network via Coursera Trees and Graphs: Basics
University of Colorado Boulder via Coursera Executing Graph Algorithms with GraphFrames on Databricks
Pluralsight Graph Theory Algorithms
Udemy