Loading the lesson
Loading the lesson
Search AllRounder.ai
Search the courses, subjects, tracks, games and features, or jump straight to a page.
Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What is a bipartite graph?
Think about how we can categorize vertices.
Define a matching in graph theory.
Consider how edges connect vertices.
What distinguishes a maximum matching from a maximal matching?
Think about sizes and limitations of the matchings.
True or False: Every maximum matching is also a maximal matching.
Consider if you can add more edges to maximum matching.
Consider a bipartite graph with 3 employees (A, B, C) and 4 tasks (1, 2, 3, 4). If A can do 1, 2; B can do 1, 3; C can do 2, 4, demonstrate if a complete matching is possible.
Think about how many unique tasks are left.
Given a bipartite graph with 5 vertices in each set and no missing edges, find out if it's possible to have a complete matching. Justify your answer.
Visualize potential connections.
4 more questions in this section. Enroll free to practise them all.
Enroll free