Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Maximum cardinality matching
Graph Chatbot
Related lectures (28)
Login to filter by course
Login to filter by course
Reset
Previous
Page 3 of 3
Next
Complexity of Algorithms
Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.
BioLocker: A Practical Biometric Authentication Mechanism based on 3D Fingervein
Presents BioLocker, a biometric authentication system using 3D finger vein recognition, covering principles, algorithms, security, and future work.
Max Flav-Min Cut in Directed Graphs
Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.
Flow Networks: Understanding Flows and Cuts in Algorithms
Covers flow networks, focusing on flows, cuts, and their applications in algorithms.
Graph Algorithms: Flows and Strongly Connected Components
Discusses graph algorithms, focusing on flow networks and strongly connected components.
Transmission Lines: Impedance Matching and Transformers
Explores terminated transmission lines, impedance matching, transformers, and power transfer techniques.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Biometric Technologies: Enhancing Security and Privacy
Explores the development of biometric technologies based on finger vein recognition to enhance security and privacy.