{"id":366,"date":"2016-12-11T16:25:00","date_gmt":"2016-12-11T16:25:00","guid":{"rendered":"https:\/\/dist2.famnit.upr.si\/?p=366"},"modified":"2017-12-26T14:54:23","modified_gmt":"2017-12-26T14:54:23","slug":"seminar-minimum-spa","status":"publish","type":"post","link":"https:\/\/dist.famnit.upr.si\/index.php\/2016\/12\/11\/seminar-minimum-spa\/","title":{"rendered":"Seminar “Minimum Spanning Acycles”, Primo\u017e \u0160kraba (12. 12. 2016)"},"content":{"rendered":"

<\/p>\n

<\/p>\n

Lecture room:<\/strong> FAMNIT-1-MP2 at 16:00<\/p>\n

Lecturer:<\/strong> dr. Primo\u0161 \u0160kraba<\/p>\n

Title:<\/strong> Minimum Spanning Acycles<\/p>\n

Abstract:<\/strong>
\nSpanning trees are a fundamental object in graph theory. In this talk, I will introduce spanning acycles, higher dimensional analogues of spanning trees which are defined on simplicial complexes rather than on graphs. These can model higher order relationships (going beyond pairwise relationships which graphs capture). I will discuss various analogues of classical results\u00a0 for spanning trees, such as Kruskal’s and Prim’s algorithms as well as mention some stability results. The talk will be self-contained and does not assume any particular background.<\/p>\n

<\/body>