hu / en

Study titled ″Popular Matchings in Complete Graphs″ by Ágnes Cseh & Telikepalli Kavitha published in Algorithmica

Published: 25 January 2021

Cseh, Á., Kavitha, T. : Popular Matchings in Complete Graphs. Algorithmica (2021).

An instance that admits two popular matchings—marked by dotted blue and dashed orange edges—but no stable matching. The preference list of each vertex is illustrated by the numbers on its edges: a lower number indicates a more preferred neighbor (Color figure online)

2021

Sep

18

M

T

W

T

F

S

S

30

31

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

1

2

3

Next month >