Minimum cut is a graph theory concept that involves partitioning the vertices of a graph into two disjoint subsets. Variations of this problem consider weighted graphs, directed graphs, terminals, and more than two sets. The weighted min-cut problem can be transformed into a weighted maximum cut problem.

Princeton University

Spring 2023

This course surveys crucial algorithms and data structures used in modern computing, with emphasis on sorting, searching, graphs, and strings. It aims to develop implementations, understand their performance, and evaluate their effectiveness.

No concepts data

+ 25 more concepts