PaperTwo-stage m-way graph partitioning
References (40)
- et al.
- et al.
The LAST algorithm: A heuristic-based static task allocation algorithm
An algorithm for partitioning the nodes of a graph
SIAM J. Algeb. Discr. Math.
(Dec. 1982)- et al.
A new heuristic for partitioning the nodes of a graph
SIAM J. Discrete Math.
(1988) - et al.
Graph bisection algorithms with good average case behavior
- et al.
Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
Eigenvalues and graph bisection: An average case analysis
Assignment Problems in Parallel and Distributed Computing
(1987)- et al.
Task allocation in a distributed computer system
- et al.
Effective algorithms for partitioning distributed programs
Heuristic models of task assignment scheduling in distributed systems
IEEE Comput.
(June 1982)
A linear time heuristic for improving network partitions
Some simplified NP-complete graph problems
Theoret. Comput. Sci.
(1976)
Finding clusters in VLSI circuits
Heuristic improvement technique for bisection of VLSI networks
Optimal partitioning of workload for distributed systems
Optimization by simulated annealing: An experimental evaluation (part I)
(1985)
An efficient heuristic procedure for partitioning graphs
Bell Syst. Tech. J.
(1970)
An improved min-cut algorithm for partitioning VLSI networks
IEEE Trans. Comput.
(1984)
Grain size determination for parallel processing
IEEE Software
(Jan. 1988)
Cited by (2)
The internet of things in the cloud: A middleware perspective
2012, The Internet of Things in the Cloud: A Middleware PerspectiveAn effective approach for distributed program allocation
1994, Parallel Algorithms and Applications
Copyright © 1993 Published by Elsevier B.V.