Fast and effective algorithms for graph partitioning and sparse-matrix ordering

IBM Journal of Research and Development

Volumn 41, Issue 1-2, 1997, Pages 171-183

  Gupta, A ^a,b,c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; GRAPHIC METHODS; LINEAR PROGRAMMING; MATRIX ALGEBRA; OPTIMIZATION;

GRAPH PARTITIONING PROBLEMS; SPARSE MATRIX ORDERING;

HEURISTIC METHODS;

EID: 0030672717     PISSN: 00188646     EISSN: None     Source Type: Journal    
DOI: 10.1147/rd.411.0171     Document Type: Article

References (32)

1. M. Yannakakis, "Computing the Minimum Fill-in Is NP-Complete," SIAM J. Alg. Discrete Meth. 2, 77-79 (1981).
2. Alan George and Joseph W.-H. Liu, "The Evolution of the Minimum Degree Ordering Algorithm," SIAM Rev. 31, 1-19 (March 1989).
3. Alan George and Joseph W.-H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981.
4. Timothy A. Davis, Patrick Amestoy, and Iain S. Duff, "An Approximate Minimum Degree Ordering Algorithm," Technical Report TR-94-039, Computer and Information Sciences Department, University of Florida, Gainesville, FL, 1994.
5. Anshul Gupta, "WGPP: Watson Graph Partitioning (and Sparse Matrix Ordering) Package: Users' Manual," Technical Report RC-20453 (90427), IBM Thomas J. Watson Research Center, Yorktown Heights, NY, May 6, 1996.
6. Anshul Gupta, "Graph Partitioning Based Sparse Matrix Ordering Algorithms for Finite-Element and Optimization Problems," Proceedings of the Second SIAM Conference on Sparse Matrices, October 1996.
7. Bruce Hendrickson and Edward Rothberg, "Improving the Runtime and Quality of Nested Dissection Ordering," Technical Report SAND96-0868J, Sandia National Laboratories, Albuquerque, NM, 1996.
8. Cleve Ashcraft and Joseph W.-H. Liu, "Robust Ordering of Sparse Matrices Using Multisection," Technical Report CS 96-01, Department of Computer Science, York University, Ontario, Canada, 1996.
9. George Karypis and Vipin Kumar, "METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System," Technical report, Department of Computer Science, University of Minnesota, Minneapolis, 1995.
10. George Karypis and Vipin Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs," Technical Report TR 95-035, Department of Computer Science, University of Minnesota, Minneapolis, 1995.
11. Edward Rothberg and Bruce Hendrickson, "Sparse Matrix Ordering Methods for Interior Point Linear Programming," Technical Report SAND96-0475J, Sandia National Laboratories, Albuquerque, NM, 1996.
12. Vipin Kumar, Ananth Grama, Anshul Gupta, and George Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin Cummings/Addison Wesley, Redwood City, CA, 1994.
13. George Karypis and Vipin Kumar, "Parallel Multilevel Graph Partitioning," Technical Report TR 95-036, Department of Computer Science, University of Minnesota, Minneapolis, 1995.
14. Madhurima Ghose and Edward Rothberg, "A Parallel Implementation of the Multiple Minimum Degree Ordering Heuristic," Technical report, Old Dominion University, Norfolk, VA, 1994.
15. Anshul Gupta, George Karypis, and Vipin Kumar, "Highly Scalable Parallel Algorithms for Sparse Matrix Factorization," Technical Report 94-63, Department of Computer Science, University of Minnesota, Minneapolis, 1994. To appear in IEEE Transactions on Parallel and Distributed Systems, 1997. Postscript file available via anonymous FTP from the site ftp://ftp.cs.umn.edu/users/kumar.
16. George Karypis, Anshul Gupta, and Vipin Kumar, "Parallel Formulation of Interior Point Algorithms," Technical Report 94-20, Department of Computer Science, University of Minnesota, Minneapolis, April 1994. Shorter versions appear in Supercomputing '94 Proceedings and Proceedings of the 1995 DIMACS Workshop on Parallel Processing of Discrete Optimization Problems.
17. Anshul Gupta and Vipin Kumar, "Parallel Algorithms for Forward and Back Substitution in Direct Solution of Sparse Linear Systems," Supercomputing '95 Proceedings, December 1995.
18. T. Bui and C. Jones, "A Heuristic for Reducing Fill in Sparse Matrix Factorization," Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993, pp. 445-452.
19. Bruce Hendrickson and Robert Leland, "A Multilevel Algorithm for Partitioning Graphs," Supercomputing '95 Proceedings, 1995. Also available as Technical Report SAND93-1301, Sandia National Laboratories, Albuquerque, NM, 1993.
20. B. W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell Syst. Tech. J., 1970.
21. C. M. Fiduccia and R. M. Mattheyses, "A Linear Time : Heuristic for Improving Network Partitions," Proceedings of the 19th IEEE Design Automation Conference, 1982, pp. 175-181.
22. W. J. Camp, S. J. Plimpton, B. A. Hendrickson, and R. W. Leland, "Massively Parallel Methods for Engineering and Science Problems, Commun. ACM 37, 31-41 (April 1994).
23. George Karypis and Vipin Kumar, "Multilevel k-way Partitioning Scheme for Irregular Graphs," Technical Report TR 95-064, Department of Computer Science, University of Minnesota, Minneapolis, 1995.
24. Alan George, "Nested Dissection of a Regular Finite-Element Mesh," SIAM J. Numer. Anal. 10, 345-363 (1973).
25. R. J. Lipton and R. E. Tarjan, "A Separator Theorem for Planar Graphs," SIAM J. Appl. Math. 36, 177-189 (1979).
26. R. J. Lipton, D. J. Rose, and R. E. Tarjan, "Generalized Nested Dissection," SIAM J. Numer. Anal. 16, 346-358 (1979).
27. Anshul Gupta, "Graph Partitioning Based Sparse Matrix Ordering Algorithms for Interior-Point Methods," Technical Report RC-20467 (90480), IBM Thomas J. Watson Research Center, Yorktown Heights, NY, May 21, 1996. Available on the WWW at the IBM Research CyberJoumal site at http://www.research.ibm.com:8080/.
28. Alan George, Joseph W.-H. Liu, and Esmond G.-Y. Ng, "Communication Reduction in Parallel Sparse Cholesky Factorization on a Hypercube," Hypercube Multiprocessors 1987, M. T. Heath, Ed., SIAM, Philadelphia, 1987, pp. 576-586.
29. 1/2τ) Assignment Algorithms," ACM Trans. Math. Software 14, 267-287 (1988).
30. Alex Pothen and C.-J. Fan, "Computing the Block Triangular Form of a Sparse Matrix," ACM Trans. Math. Software, 1990.
31. Cleve Ashcraft and Joseph W.-H. Liu, "Generalized Nested Dissection: Some Recent Progress," Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, Snowbird, UT, June 1994.
32. Cleve Ashcraft, "Compressed Graphs and the Minimum Degree Algorithm," SIAM J. Sci. Computing 16, 1404-1411 (1995).