Eulerian Cycles

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

Eulerian and Hamiltonian Cycles

Starting with the well-known "Bridges of Königsberg" riddle, we prove the well-known characterization of Eulerian graphs. We discuss Hamiltonian paths and give sufficient criteria for their existence with Dirac's and Ore's theorem.

Impartido por:

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explora nuestro catálogo

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