Chapter 6

Matching

2

6.1 SYSTEMS OF DISTINCTRE PRESENTATIVES

3

4

5

6

6.2 MATCHINGS IN GRAPHS

7

8

9

10

11

12

13

14

15

16

17

18

19

6.3 A MATCHING ALGORITHM

20

21

22

23

24

Applying the Algorithm to a Maximum Independent Set

25

26

27

28

Assigning Courses

29

30

31

32

33

34

35

36

6.4 APPLICATIONS OF THE ALGORITHM

37

38

39

40

41

42

43

44

The Bottleneck Problem

45

46

47

6.5 THEHUNGARIAN METHOD

48

49

Justification of the Hungarian Algorithm

50

Matrices That Are Not Square

51

52

53

Independent Sets with Maximum Sum