Minimum Spanning Trees

Loading...
Del curso dictado por Shanghai Jiao Tong University
Discrete Mathematics
59 calificaciones
Shanghai Jiao Tong University
59 calificaciones
De la lección
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.

Conoce a los instructores

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

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.