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
Blossom algorithm
Formal sciences
Mathematics
Discrete mathematics
Graph theory
Graph Chatbot
Related lectures (8)
Login to filter by course
Login to filter by course
Reset
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Ford-Fulkerson Method: Disjoint-set Data Structures
Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.
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.
Maximum Flow: Theory and Applications
Explores maximum flow in graphs, covering Ford-Fulkerson algorithm, flow conservation, and minimum cut.
Max-flow and Disjoint Sets
Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
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.
Biometric Technologies: Enhancing Security and Privacy
Explores the development of biometric technologies based on finger vein recognition to enhance security and privacy.
Previous
Page 1 of 1
Next