Multiple-Way Network Partitioning
暂无分享,去创建一个
[1] Brian W. Kernighan,et al. A proper model for the partitioning of electrical circuits , 1972, DAC '72.
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Melvin A. Breuer,et al. A class of min-cut placement algorithms , 1988, DAC '77.
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Earl R. Barnes. An algorithm for partitioning the nodes of a graph , 1981, CDC 1981.
[6] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[7] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[8] Frank Thomson Leighton,et al. Graph Bisection Algorithms with Good Average Case Behavior , 1984, FOCS.
[9] Balakrishnan Krishnamurthy,et al. An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.
[10] Frank Thomson Leighton,et al. Graph bisection algorithms with good average case behavior , 1984, Comb..
[11] Balakrishnan Krishnamurthy,et al. Constructing Test Cases for Partitioning Heuristics , 1987, IEEE Transactions on Computers.
[12] S.,et al. An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .