All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:19, 15 February 2023 Admin talk contribs created page Directed (Optimum Branchings), Super Dense MST (Created page with "{{DISPLAYTITLE:Directed (Optimum Branchings), Super Dense MST (Minimum Spanning Tree (MST))}} == Description == A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected; edge-weighted undirected graph that connects all the vertices together; without any cycles and with the minimum possible total edge weight. Here, we're given a directed graph with a root and $E=\Omega(V^2)$ edges, and we wish to find a spanning arborescence...")