Learn · Design and Analysis of Algorithms with Applications
Lecture 13 of 60Week 3
Lecture 13: Stable Matching Problem
Prof. Srinivasa Rao Pentyala · IIT-ISM Dhanbad
Credits and licence
- From
- Design and Analysis of Algorithms with Applications, IIT-ISM Dhanbad (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Kharagpur.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 01: Basic Concepts of Algorithms
- Lecture 02: Performance and Asymptotic Analysis
- Lecture 03: Mathematical Notations and Recursive Algorithms
- Lecture 04: Mathematical Notations and case Studies
- Lecture 05: Greedy Techniques
- Lecture 06: The 0 –1 KanapsackProblems
- Lecture 07: Huffman Algorithm & Knapsack Problem
- Lecture 08: Review of Graph Algorithms
- Lecture 09: Breadth First Search Algorithm (BFS)
- Lecture 10: Depth First Search Algorithm (DFS)
- Lecture 11: Kruskal’s Algorithms
- Lecture 12: Prims’s Algorithms
- Lecture 13: Stable Matching Problem
- Lecture 14: Shortest Path Problem
- Lecture 15: Union Find data Structure
- Lecture 16: Divide and Conquer Algorithms
- Lecture 17: Heap Sort, Bucket Sort Algorithms
- Lecture 18: Binary Search Tree Algorithms
- Lecture 19: Optimal Storage on Taps Algorithms
- Lecture 20: Stassen’s matrix multiplication Algorithms
- Lecture 21: Bellman-Ford algorithm
- Lecture 22: Examples: Bellman-Ford algorithm
- Lecture 23: Examples: Bellman-Ford algorithm
- Lecture 24: All pairs shortest path problem
- Lecture 25: Examples
- Lecture 26: Representation of Polynomials and Complexity
- Lecture 27: The DFT Algorithms and Complexity
- Lecture 28: Representation of polynomials
- Lecture 29: The DFT and FFT
- Lecture 30: Efficient FFT and implementation
- Lecture 31: Network Algorithms & Complexity
- Lecture 32: Approximation Algorithms
- Lecture 33: Approximation Algorithms
- Lecture 34: Parallel Algorithms
- Lecture 35: Online Algorithms
- Lecture 36: Algorithmic Trading, Portfolio Optimization
- Lecture 37: Risk Analysis and Fraud Detection
- Lecture 38: Risk Analysis and Fraud Detection: Approximation Algorithms
- Lecture 39: Logistics and Supply Chain Management
- Lecture 40: Scheduling, Inventory Management
- Lecture 41: Bioinformatics: Applications of Algorithms
- Lecture 42: Applications involve sequence alignment,
- Lecture 43: Gene sequencing, protein prediction
- Lecture 44: Complex Biological Data Analysis Tasks
- Lecture 45: Applications in Database Systems of Large Computation
- Lecture 46: Applications in Database Systems
- Lecture 47: Fundamental Algorithms for Sorting, Searching
- Lecture 48: Fundamental Algorithms for Sorting and Pattern Matching
- Lecture 49: Searching and Data Manipulation
- Lecture 50: Web Applicatons
- Lecture 51: Applications in Data Science and Machine Learning
- Lecture 52: Data Analysis Applications, Pattern Recognition
- Lecture 53: Optimization in Machine Learning
- Lecture 54: Clustering, Classification
- Lecture 55: Regression, and Neural Networks,WeatherPredictions
- Lecture 56: Big Data Processing: Developing
- Lecture 57: Data Mining, Natural Language Processing
- Lecture 58: Advanced Machine Learning for handling
- Lecture 59: Extracting Insights from massive Datasets
- Lecture 60: Extracting insights from Massive Datasets (Conti..)