| RUS ENG |
| Полная версия |
|
|
|
| СЕМИНАРЫ |
|
Knots, Graphs and Groups seminar
|
|||
|
|
|||
|
[Distance multiplication algorithms for Monge, unit-Monge matrices] Рубаненко Мария |
|||
|
Аннотация: Distance (tropical) matrix multiplication is a fundamental tool for designing algorithms operating on distances in graphs and different problems solvable by dynamic programming. In applications such as longest common subsequence, edit distance, and longest increasing subsequence, the matrices are even more structured: they are like Monge matrices. We discuss SMAWK, MMT(Multiple Maxima Trees) algorithms for the tropical product of Monge and unit-Monge matrices, core-sparse Monge matrix multiplication and Tiskin's algorithm for simple unit-Monge matrices. Язык доклада: английский Website: https://us02web.zoom.us/j/81866745751?pwd=bEFqUUlZM1hVV0tvN0xWdXRsV2pnQT09 |
|||