PODCAST · education
Graph Algorithms (WT 2023/24) - tele-TASK
Graphs play a central role in the world of algorithms. For example, navigation devices use an algorithm to compute shortest paths on a graph to answer a route query. Many planning and assignment problems can also be easily modeled as problems on graphs. In principle, it is true that a great many problems can be thought of as graph problems, so designing efficient algorithms for such problems is an important subfield of theoretical computer science.In this lecture we will enter the world of graph algorithms. On the one hand, we will learn about important algorithmic problem classes on graphs and efficient algorithms to solve them. Among other things, we will look at finding shortest paths, flows, cuts, separators, and matchings in graphs. Algorithms for these problems have a wide variety of applications, making them an important and useful tool for any algorithmicist. On the other hand, we will also study how constraints on the graphs at hand affect the complexity of the problems a
No episodes available yet.
We're indexing this podcast's transcripts for the first time — this can take a minute or two. We'll show results as soon as they're ready.
No matches for "" in this podcast's transcripts.
No topics indexed yet for this podcast.
Loading reviews...
ABOUT THIS SHOW
Graphs play a central role in the world of algorithms. For example, navigation devices use an algorithm to compute shortest paths on a graph to answer a route query. Many planning and assignment problems can also be easily modeled as problems on graphs. In principle, it is true that a great many problems can be thought of as graph problems, so designing efficient algorithms for such problems is an important subfield of theoretical computer science.In this lecture we will enter the world of graph algorithms. On the one hand, we will learn about important algorithmic problem classes on graphs and efficient algorithms to solve them. Among other things, we will look at finding shortest paths, flows, cuts, separators, and matchings in graphs. Algorithms for these problems have a wide variety of applications, making them an important and useful tool for any algorithmicist. On the other hand, we will also study how constraints on the graphs at hand affect the complexity of the problems a
HOSTED BY
Loading similar podcasts...
Frequently Asked Questions
How many episodes does Graph Algorithms (WT 2023/24) - tele-TASK have?
Graph Algorithms (WT 2023/24) - tele-TASK currently has 0 episodes available on PodParley. New episodes are automatically indexed when they're published to the podcast feed.
What is Graph Algorithms (WT 2023/24) - tele-TASK about?
Graphs play a central role in the world of algorithms. For example, navigation devices use an algorithm to compute shortest paths on a graph to answer a route query. Many planning and assignment problems can also be easily modeled as problems on graphs. In principle, it is true that a great many...
How often does Graph Algorithms (WT 2023/24) - tele-TASK release new episodes?
Graph Algorithms (WT 2023/24) - tele-TASK is no longer actively publishing new episodes, but the existing catalog remains available.
Where can I listen to Graph Algorithms (WT 2023/24) - tele-TASK?
You can listen to Graph Algorithms (WT 2023/24) - tele-TASK on PodParley by clicking any episode. We provide an embedded audio player for direct listening, and you can also subscribe via your preferred podcast app using the RSS feed.
URL copied to clipboard!