A matching in graph theory is a set of edges without common vertices. Each vertex can only appear in one edge of the matching. Finding a matching in a bipartite graph can be treated as a network flow problem.
UC Berkeley
Spring 2020
This is an introductory course to computer science theory, exploring the design and analysis of various algorithms, number theory, and complexity. The prerequisites include familiarity with mathematical induction, big-O notation, basic data structures, and programming in a standard language.
No concepts data
+ 36 more concepts