### Citations

5028 | Optimization by Simulated Annealing
- Kirkpatrick, Gelatt, et al.
- 1983
(Show Context)
Citation Context ...on Dividing a graph into sets of nodes with the aim of optimizing certain cost-functions constitute an important combinatorial problem with applications including VLSI circuit partitioning and layout =-=[4]-=-, and multiprocessor task allocation [1]. For this work, we use the following formulation of the k-way graph partitioning (GP) problem. k-way GP problem: Input: ffl Undirected graph G(V; E) of n nodes... |

1314 |
An Efficient Heuristic Procedure for Partitioning Graphs
- Kernighan, Lin
- 1970
(Show Context)
Citation Context ... (also called bipartitioning), direct algorithm based on max-flow min-cut technique is given by Stone and Bokhari [7], local search based iterative algorithm is given by Kernighan and Lin (KL-method) =-=[2]-=-, and simulated annealing (SA-method) is given by Kirkpatrick et al. [4]. For general k-way GP problem, hierarchical methods using repeated bipartitioning are given in [2], and non-hierarchical method... |

787 | PVM: A Framework for Parallel Distributed Computing
- Sunderam
- 1990
(Show Context)
Citation Context ...ng on further performance comparisons with existing algorithms, including the simulated annealing method. We have also implemented these algorithms and some of their variations in the distributed PVM =-=[8]-=- environment. The initial results are encouraging [3], and we believe that implementation with more efficient communications support will improve the distributed performance significantly. As a future... |

137 |
Multiple-way network partitioning
- Sanchis
- 1989
(Show Context)
Citation Context ... annealing (SA-method) is given by Kirkpatrick et al. [4]. For general k-way GP problem, hierarchical methods using repeated bipartitioning are given in [2], and non-hierarchical methods are given in =-=[6]-=-. Recently Lee et al. [5] described a simple and efficient nonhierarchical algorithm for general k-way partitioning, and have shown that their algorithm outperforms the KLmethod in both partition-cost... |

51 |
Assignment Problems in Parallel and Distributed Computing
- Bokhari
- 1987
(Show Context)
Citation Context ...ith the aim of optimizing certain cost-functions constitute an important combinatorial problem with applications including VLSI circuit partitioning and layout [4], and multiprocessor task allocation =-=[1]-=-. For this work, we use the following formulation of the k-way graph partitioning (GP) problem. k-way GP problem: Input: ffl Undirected graph G(V; E) of n nodes (in the set V ), and m edges (in the se... |

24 |
Control of distributed processes
- Stone, Bokhari
- 1978
(Show Context)
Citation Context ...roblem: direct or constructive methods and iterative improvement techniques. For k = 2 (also called bipartitioning), direct algorithm based on max-flow min-cut technique is given by Stone and Bokhari =-=[7]-=-, local search based iterative algorithm is given by Kernighan and Lin (KL-method) [2], and simulated annealing (SA-method) is given by Kirkpatrick et al. [4]. For general k-way GP problem, hierarchic... |

12 |
An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems
- Lee, Kim, et al.
- 1990
(Show Context)
Citation Context ... given by Kirkpatrick et al. [4]. For general k-way GP problem, hierarchical methods using repeated bipartitioning are given in [2], and non-hierarchical methods are given in [6]. Recently Lee et al. =-=[5]-=- described a simple and efficient nonhierarchical algorithm for general k-way partitioning, and have shown that their algorithm outperforms the KLmethod in both partition-cost, and computation time. T... |

2 | Sequential and distributed algorithms for fast graph partitioning
- Khan
- 1994
(Show Context)
Citation Context ...e their bid, which is the main computation part in this algorithm, independent of one another. However the results presented later in this paper uses a sequential implementation, which is detailed in =-=[3]-=-. Since the assignment of a node to a particular part is decided based on the priorities (bids) given for this node from different workers, we refer to this algorithm as the Auctionsalgorithm. This st... |