Parametric Shortest Paths in Planar Graphs
Offered By: IEEE via YouTube
Course Description
Overview
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
مقدمة في علم الحاسوب والبرمجةMassachusetts Institute of Technology via Edraak Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer Computational Thinking using Python
Massachusetts Institute of Technology via edX Java: Algorithms
Codecademy Technical Interview Practice with Java
Codecademy