Algorithms that split a graph into parts while cutting as few links as possible. Karger's algorithm finds a minimum cut by repeatedly contracting randomly chosen edges, the Kernighan-Lin algorithm improves a division of a graph into two balanced halves by swapping pairs of vertices, and the minimum k-cut problem asks for the cheapest way to separate a graph into k components. They are used in circuit layout, clustering and parallel computing.
All Graph Cut and Partitioning Algorithms
Filter Results3 entries
Sources
Watershed (image processing) (Wikipedia)
Has Member: Watershed Algorithm, IntroductionQuote, Has Member: Watershed Algorithm, Introduction
In graphs, watershed lines may be defined on the nodes, on the edges, or hybrid lines on both nodes and edges.
Karger's Algorithm (Wikipedia)
Has Member: Karger's Algorithm, LeadQuote, Has Member: Karger's Algorithm, Lead
In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph.
Wikipedia: Kernighan-Lin algorithm
Has Member: Kernighan-Lin algorithm, LeadQuote, Has Member: Kernighan-Lin algorithm, Lead
The Kernighan-Lin algorithm is a heuristic algorithm for finding partitions of graphs.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.