Main Page for the Group 10 of the Algorithmics (A-GEI) course at FIB
Fall term 2023-2024
Slides
1. Basic algorithmic concepts
Introduction and review (
with transitions
) (
without transitions
)
Selection (
with transitions
) (
without transitions
)
Sorting (
with transitions
) (
without transitions
)
2. Greedy algorithms
First examples (
with transitions
) (
without transitions
)
Minimum spanning tree (
with transitions
) (
without transitions
)
Minimum cost arborescence (
without transitions
)
Streaming algorithms (
with transitions
) (
without transitions
)
Some data structures
Fibonacci heaps
and
Union Find
3. Dynamic Programming
Backtracking algorithms (
with transitions
) (
without transitions
)
Dynamic Programming: Basic examples (
with transitions
) (
without transitions
)
Dynamic Programming: Additional examples (
with transitions
) (
without transitions
)
Distance in graphs (
with transitions
) (
without transitions
)
4. Flows in networks
MaxFlow and MinCut problems: Ford Fulkerson algorithm (
with transitions
) (
without transitions
)
Edmons Karp algorithm, circulations (
with transitions
) (
without transitions
)
5. Other algorithmic techniques
Introduction to Linear Programming (
with transitions
) (
without transitions
)
