Acerca de este Curso
4.6
141 calificaciones
32 revisiones
100 % en línea

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.
Nivel principiante

Nivel principiante

Horas para completar

Aprox. 14 horas para completar

Sugerido: 5 weeks, 3-5 hours/week ...
Idiomas disponibles

Inglés (English)

Subtítulos: Inglés (English)
100 % en línea

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.
Nivel principiante

Nivel principiante

Horas para completar

Aprox. 14 horas para completar

Sugerido: 5 weeks, 3-5 hours/week ...
Idiomas disponibles

Inglés (English)

Subtítulos: Inglés (English)

Programa - Qué aprenderás en este curso

Semana
1
Horas para completar
3 horas para completar

What is a Graph?

What are graphs? What do we need them for? This week we'll see that a graph is a simple pictorial way to represent almost any relations between objects. We'll see that we use graph applications daily! We'll learn what graphs are, when and how to use them, how to draw graphs, and we'll also see the most important graph classes. We start off with two interactive puzzles. While they may be hard, they demonstrate the power of graph theory very well! If you don't find these puzzles easy, please see the videos and reading materials after them....
Reading
14 videos (Total 52 minutos), 5 readings, 5 quizzes
Video14 videos
Knight Transposition2m
Seven Bridges of Königsberg4m
What is a Graph?7m
Graph Examples2m
Graph Applications3m
Vertex Degree3m
Paths5m
Connectivity2m
Directed Graphs3m
Weighted Graphs2m
Paths, Cycles and Complete Graphs2m
Trees6m
Bipartite Graphs4m
Reading5 lecturas
Slides1m
Slides1m
Slides1m
Slides1m
Glossary10m
Quiz2 ejercicios de práctica
Definitions10m
Graph Types10m
Semana
2
Horas para completar
5 horas para completar

CYCLES

We’ll consider connected components of a graph and how they can be used to implement a simple program for solving the Guarini puzzle and for proving optimality of a certain protocol. We’ll see how to find a valid ordering of a to-do list or project dependency graph. Finally, we’ll figure out the dramatic difference between seemingly similar Eulerian cycles and Hamiltonian cycles, and we’ll see how they are used in genome assembly! ...
Reading
12 videos (Total 89 minutos), 4 readings, 6 quizzes
Video12 videos
Total Degree5m
Connected Components7m
Guarini Puzzle: Code6m
Lower Bound5m
The Heaviest Stone6m
Directed Acyclic Graphs10m
Strongly Connected Components7m
Eulerian Cycles4m
Eulerian Cycles: Criteria11m
Hamiltonian Cycles4m
Genome Assembly12m
Reading4 lecturas
Slides1m
Slides1m
Slides1m
Glossary10m
Quiz4 ejercicios de práctica
Computing the Number of Edges10m
Number of Connected Components10m
Number of Strongly Connected Components10m
Eulerian Cycles2m
Semana
3
Horas para completar
3 horas para completar

Graph Classes

This week we will study three main graph classes: trees, bipartite graphs, and planar graphs. We'll define minimum spanning trees, and then develop an algorithm which finds the cheapest way to connect arbitrary cities. We'll study matchings in bipartite graphs, and see when a set of jobs can be filled by applicants. We'll also learn what planar graphs are, and see when subway stations can be connected without intersections. Stay tuned for more interactive puzzles!...
Reading
11 videos (Total 55 minutos), 4 readings, 6 quizzes
Video11 videos
Trees8m
Minimum Spanning Tree6m
Job Assignment3m
Bipartite Graphs5m
Matchings3m
Hall's Theorem7m
Subway Lines1m
Planar Graphs3m
Euler's Formula4m
Applications of Euler's Formula7m
Reading4 lecturas
Slides1m
Slides1m
Slides1m
Glossary10m
Quiz3 ejercicios de práctica
Trees10m
Bipartite Graphs10m
Planar Graphs10m
Semana
4
Horas para completar
4 horas para completar

Graph Parameters

We'll focus on the graph parameters and related problems. First, we'll define graph colorings, and see why political maps can be colored in just four colors. Then we will see how cliques and independent sets are related in graphs. Using these notions, we'll prove Ramsey Theorem which states that in a large system, complete disorder is impossible! Finally, we'll study vertex covers, and learn how to find the minimum number of computers which control all network connections....
Reading
14 videos (Total 52 minutos), 5 readings, 8 quizzes
Video14 videos
Graph Coloring3m
Bounds on the Chromatic Number3m
Applications3m
Graph Cliques3m
Cliques and Independent Sets3m
Connections to Coloring1m
Mantel's Theorem5m
Balanced Graphs2m
Ramsey Numbers2m
Existence of Ramsey Numbers5m
Antivirus System2m
Vertex Covers3m
König's Theorem8m
Reading5 lecturas
Slides1m
Slides1m
Slides1m
Slides1m
Glossary10m
Quiz4 ejercicios de práctica
Graph Coloring10m
Cliques and Independent Sets10m
Ramsey Numbers10m
Vertex Covers10m
4.6
32 revisionesChevron Right

Principales revisiones

por RHNov 17th 2017

Was pretty fun and gave a good intro to graph theory. Definitely felt inspired to go deeper and understood the most basic proof ideas. The later lectures can spike in difficulty though. Very nice!

por DNNov 12th 2017

I like this course. Very basic, but teachers are really great and explanations are perfect! Highly recommended for all who wants to begin with Graph Theory.

Instructor

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering

Acerca de University of California San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

Acerca de National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communications, IT, mathematics, engineering, and more. Learn more on www.hse.ru...

Acerca del programa especializado Introduction to Discrete Mathematics for Computer Science

Discrete Math is needed to see mathematical structures in the object you work with, and understand their properties. This ability is important for software engineers, data scientists, security and financial analysts (it is not a coincidence that math puzzles are often used for interviews). We cover the basic notions and results (combinatorics, graphs, probability, number theory) that are universally needed. To deliver techniques and ideas in discrete mathematics to the learner we extensively use interactive puzzles specially created for this specialization. To bring the learners experience closer to IT-applications we incorporate programming examples, problems and projects in our courses....
Introduction to Discrete Mathematics for Computer Science

Preguntas Frecuentes

  • Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.

  • Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darán un Certificado cuando completes el trabajo. Se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.