Minimum Spanning Trees

Loading...
From the course by 上海交通大学
Discrete Mathematics
52 ratings
上海交通大学
52 ratings
From the lesson
Spanning Trees
We discuss spanning trees of graphs. In particular we present Kruskal's algorithm for finding the minimum spanning tree of a graph with edge costs. We prove Cayley's formula, stating that the complete graph on n vertices has n^(n-2) spanning trees.

Meet the Instructors

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering