Seminár z teórie grafov - Petr Kovář (11.3.2021)

vo štvrtok 11.3.2021 o 9:50 hod.

09. 03. 2021 09.54 hod.
Od: Martin Škoviera

Prednášajúci: Petr Kovář (VŠB - Technická Univerzita Ostrava)

Názov: A nice application of complete graph decompositionh

Termín: 11.3.2021, 9:50 hod.

Prístupový kód do MS TEAMS (pre používateľov z UK): gglxxc7 
Pripojenie (pre hostí mimo UK)

Graph decompositions, graceful labelings, perfect difference sets - all these are well established topics in Graph Theory or in Number Theory. They have a surprising and nice application in memory distribution of a parallel numerical solution of a large system of equations with dense matrices, which arise e.g. when using Boundary Element Method.

In this talk we present a brief overview of the classical results and explain the method, that allowed us to solve larger problems than traditional parallelization would allow. We have successfully used cyclic graph decompositions when solving systems with millions of variables.

Stránka seminára