Hi everyone! Today I was looking for a way to solve de LCS (Longest Common Subsequence) problem for n strings and I found a curious comment of a member saying that this problem can be reduced to a Vertex Cover. Could someone please help me explaining how to do it?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 167 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 5 | nor | 151 |
| 7 | atcoder_official | 147 |
| 8 | TheScrasse | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 143 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/01/2024 08:18:11 (g1).
Desktop version, switch to mobile version.
Supported by
There is a paper here proving reduction to PSAT (Propositional SATisfiability problem)
It's here http://codeforces.com/blog/entry/3188, at the end
So the question is how to reduce them?
Exactly! :)
deleted.