Dynamic programming Design technique, like divide-and-conquer. Example: Longest Common Subsequence (LCS)

Consider a digraph G = (V, E) with edge-weight function w : E → R. The weight of path p = v1 → v2 → L → vk is defined to be

Shortest paths Single-source shortest paths Nonnegative edge weights

Take-home quiz No notes (except this one)

Algorithms Day 40 L23.2 Recall from Lecture 22 • Flow value: | f | = f(s, V). Cut: Any partition (S, T) of V such that s ∈ S and t ∈ T

Problem: Maintain a dynamic collection of pairwise-disjoint sets= {S1, S2, .. S } Each set S; has one element distinguished as the representative element, rep[]

3.1 引言 3.2 多媒体信息同步描述法 3.3 多媒体同步控制机制

5.1 引言 5.2 基于LAN的接入 5.3 基于交互式电视网的接入 5.4 基于电话网的ADSL接入

一、完成下列反应：

The Nobel Prize in Chemistry 1990 “for his contribution to Retrosynthetic analysis