An Efficient Heuristic Procedure for Partitioning Graphs
Brian W. Kernighan, Shang Min Lin
Bell System Technical Journal · 1970 · 5,330 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Kernighan, B. W., & Lin, S. M. (1970). An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2), 291–307. https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
In text: (Kernighan & Lin, 1970)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This problem arises in several physical situations — for example, in assigning the components of electronic circuits to circuit boards to minimize the number of connections between boards. This paper presents a heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems.
Related papers
Metadata from OpenAlex (CC0). Citations are generated from the published record.