Optimal Sequential Partitions of Graphs

@article{Kernighan1971OptimalSP,
  title={Optimal Sequential Partitions of Graphs},
  author={Brian W. Kernighan},
  journal={J. ACM},
  year={1971},
  volume={18},
  pages={34-40}
}
This paper presents an algorithm for finding a minimum cost partition of the nodes of a graph into subsets of a given size, subject to the constraint that the sequence of the nodes may not be changed, that is, that the nodes in a subset must have consecutive numbers. The running time of the procedure is proportional to the number of edges in the graph. One possible application of this algorithm is in partitioning computer programs into pages for operation in a paging machine. The partitioning… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

On Optimal and Balanced Sparse Matrix Partitioning Problems

2012 IEEE International Conference on Cluster Computing • 2012
View 8 Excerpts
Highly Influenced

Optimisation of Partitioned Temporal Joins

View 3 Excerpts
Highly Influenced

Efficient Algorithm for the Partitioning of Trees

IBM Journal of Research and Development • 1974
View 4 Excerpts
Highly Influenced

Acyclic Partitioning of Large Directed Acyclic Graphs

2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID) • 2017
View 1 Excerpt

Splitting functions in code management on scratchpad memories

2016 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) • 2016
View 1 Excerpt

Splitting functions into single-entry regions

2014 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES) • 2014
View 1 Excerpt

Similar Papers

Loading similar papers…