Все публикации

0:15:27

Bridge-building, Chinese Postman, and Hierholzer's Algorithm (NC 3-2)

0:02:07

Why you need Networks

0:15:57

Closeness, betweenness, degree- and spectral centrality (NC 19-1)

0:22:57

Dynamical Systems, Mass-Action Laws and Epidemics (NC12-1)

0:21:37

Excess degree, degree distributions and the friendship paradox (NC6-1)

0:23:34

The small world (NC5.1)

0:18:17

Königsberg Bridge Problem and Eulerian Walks (NC3.1)

0:11:41

Branch and Bound (NC2.2)

0:16:29

The shortest path (NC2.1)

0:26:10

Exercises for Kruskal's Greedy Algorithm (NC1.E2)

0:09:30

Kruskal's Greedy Algorithm (NC1.2)

0:10:00

Exercises for Brute Force and the Number of Networks (NC1.E1)

0:13:12

Brute Force and the Number of Networks (NC1.1)

0:12:33

Generating Functions made simple

0:11:17

Generalized Models: A quick Introduction

0:09:43

Curse of Dimensionality

0:09:54

Watch this before modelling

0:16:16

Estimation of functional diversity and species traits from ecological monitoring data

0:20:01

May's Paradox

0:11:58

Defector Avoidance in cooperation games on networks