・Lecture 1: Combinatorial problems on trees inside phylogenetic networks[23:59]
・Lecture 2: A structure theorem for rooted binary phylogenetic networks and its various applications[24:59]
・根付き二分系統ネットワークの構造定理と全域系統樹に関する色々な問題への応用[49:47]
・Discrete Math 1: Fundamentals of Graphs (Part1)[57:22]
・Discrete Math 2: Fundamentals of Graphs (Part2): Trees \u0026 Minimum Spanning Trees[56:40]
・Discrete Math 3: Rooted trees \u0026 BFS (breadth-first search) algorithm[22:28]
・Discrete Math 4: Orientation \u0026 DFS (depth-first search) algorithm[27:11]
・Discrete Math 5: Shortest Path Problem: Dijkstra Method \u0026 Warchal-Floyd Method[29:59]
・Discrete Math 6: Euler graphs \u0026 the postman problem[25:40]
・Discrete Math 7: Hamiltonian Graphs \u0026 the Travelling Salesman Problem[32:32]
・Discrete Math 8: Maximum flow problem (1): Basic knowledge of flow networks[22:35]
・Discrete Math 9: Maximum flow problem (2): Augmenting Path Algorithm \u0026 Max-Flow Min-Cut Theorem[21:06]
・Discrete Math 10: Matching (1): Matching Basics and Perfect Matching (Hall's Marriage Theorem, etc.)[24:48]
・Discrete Math 11: Matching (2): Two ways to find maximum matching[22:46]
・Discrete Math 12: Matching (3): Stable Marriage Problem, Gale-Shapley Algorithm \u0026 Applications[37:14]
・Discrete Math 13: Plane drawing of graphs \u0026 map coloring[38:18]
>

INFO:
I am a mathematician with a medical degree who specialises in discrete mathematics relevant to the analysis of biological data. Currently, I am an Associate ...
Momoko Hayamizu