StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Prove that any minimum vertex cover of a clique of size n must have exactly n-1 vertices
| Author | Votes | Δ |
|---|---|---|
| Paul Hankin | 0 | 0.00 |
Last visited: Sep 14, 2014, 5:07:29 AM