Lectures related to Edge contraction

Explores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.

Discusses graph algorithms, focusing on flow networks and strongly connected components.

Covers memory management concepts such as block headers, external fragmentation, reference counting, and mark & sweep garbage collection.