Multilevel algorithms for multi-constraint graph partitioning

Proceedings of the International Conference on Supercomputing

Volumn 1998-November, Issue , 1998, Pages

  Karypis, George ^a   Kumar, Vipin ^a  

^a University of Minnesota   (United States)

Author keywords

Graph partitioning; Numerical simulations; Parallel processing

Indexed keywords

GRAPH THEORY;

ARBITRARY NUMBER; CONSTRAINT GRAPH; EDGE CUTS; GRAPH PARTITIONING; GRAPH PARTITIONING ALGORITHMS; MULTI-CONSTRAINTS; MULTILEVEL ALGORITHM; NUMERICAL SIMULATION; PARALLEL PROCESSING; PARTITIONING PROBLEM;

COARSENING;

EID: 77954518302     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1998.10018     Document Type: Conference Paper

References (12)

1. T. Bui and C. Jones.A heuristic for reducing fill in sparse matrix factorization. In 6th SIAM Conf. Parallel Processing for Scientific Computing, pages 445-452, 1993.
2. C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. In In Proc. 19th IEEE Design Automation Conference, pages 175-181, 1982.
3. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman, San Francisco, CA, 1979.
4. Bruce Hendrickson and Robert Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Laboratories, 1993.
5. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. Technical Report TR 98-019, Department of Computer Science, University of Minnesota, 1998.
6. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998. Also available on WWW at URL http://www.cs.umn.edu/~karypis.
7. G. Karypis and V. Kumar. A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 1998 (to appear). Also available on WWW at URL http://www.cs.umn.edu/~karypis. A short version appears in Intl. Conf. on Parallel Processing 1995.
8. George Karypis and Vipin Kumar. A coarse-grain parallel multilevel k-way partitioning algorithm. In Proceedings of the eighth SIAM conference on Parallel Processing for Scientific Computing, 1997.
9. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
10. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36:177-189, 1979.
11. Gary L. Miller, Shang-Hua Teng, and Stephen A. Vavasis. A unified geometric approach to graph separators. In Proceedings of 31st Annual Symposium on Foundations of Computer Science, pages 538-547, 1991.
12. Kirk Schloegel. Dissertation in progress. PhD thesis.