I want to know how calculate Min Vertex Cover and Max Matching in a Ordinary Bipartite Graph
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | atcoder_official | 162 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
→ Find user
→ Recent actions
Min Vertex Cover and Max Matching in a Ordinary Bipartite Graph
Revision en2, by hectoradrian_UH, 2016-10-10 23:41:18
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
hectoradrian_UH | 2016-10-10 23:43:01 | 14 | ||
| en2 |
|
hectoradrian_UH | 2016-10-10 23:41:18 | 2 | ||
| en1 |
|
hectoradrian_UH | 2016-10-10 23:37:34 | 153 | (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/19/2024 09:52:24 (l2).
Desktop version, switch to mobile version.
Supported by
