Minimum Spanning Trees

video-placeholder
Loading...
Ver programa

Reseñas

3.3 (142 calificaciones)

  • 5 stars
    42,95 %
  • 4 stars
    11,97 %
  • 3 stars
    7,04 %
  • 2 stars
    11,97 %
  • 1 star
    26,05 %

NP

22 de oct. de 2017

Filled StarFilled StarFilled StarFilled StarFilled Star

Fantastic course. Fascinating material, presented at a reasonably fast pace, and some really challenging assignments.

AG

4 de dic. de 2018

Filled StarFilled StarFilled StarFilled StarFilled Star

This course is good to comprehend relation, function and combinations.

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.

Impartido por:

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explora nuestro catálogo

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