'The complexity of a matching game of in a bipartite graph
The matching game of a bipartite graph G=(V1, V2, E) in which edges are only connected vertices V1 to vertices in V2. The player are the vertices that is the union of V1 and V2. Each player has to select one of its neighors. What is the time complexity to find the combination that player i selects player j and also player j selects player i ?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|