Relaxed implementation of spectral methods for graph partitioning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1457 LNCS, Issue , 1998, Pages 366-375

  Xu, Chengzhong ^a   Nie, Yibing ^a  

^a Wayne State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FAST IMPLEMENTATION; GRAPH PARTITIONING; HIGH-QUALITY SOLUTIONS; ITERATION NUMBERS; LANCZOS ALGORITHM; OPTIMAL STRATEGIES; RECURSIVE BISECTION; SPECTRAL BISECTION METHODS;

ITERATIVE METHODS;

EID: 84883481188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0018553     Document Type: Conference Paper

References (15)

1. S. T. Barnard and H. D. Simon. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2):101-117, 1994.
2. R. Diekmann, B. Monien, and R. Preis. Load balancing strategies for distributed memory machines. Technical Report TR-RSFB-97-050, Department of Computer Science, University of Paderborn, 1997.
3. B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel graphs. Technical Report SAND 92-1460, Sandia National Lab., USA, 1992.
4. B. Hendrickson and R. Leland. The Chaco user's guide. Technical Report SAND 93-2339, Sandia National Lab., USA, 1993.
5. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report Tech. Rep. SAND 93-11301, Sandia National Lab., USA, 1993.
6. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, Department of Computer Science, University of Minnesota, 1995.
7. J. De Keyser and D. Roose. Grid partitioning by inertial recursive bisection. Technical Report TW 174, Katholieke Universiteit leuven, Belgium, 1992.
8. B.N. Parlett. The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, NJ., 1980.
9. B. N. Parlett and D. S. Scott. The Lanczos algorithm with selective orthogonalization. Mathematics of Computation, 33(145):217-238, 1979.
10. A. Pothen, H. D. Simon, and K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Analysis and Applications, 11(3):430-452, July 1990.
11. H. D. Simon and A. Sohn. HARP: A fast spectral partitioner. In Proc. of the 9th ACM Symp. on Parallel Algorithms and Architectues, June 1997.
12. H. D. Simon and S.-H. Teng. How good is recursive bisection. Technical Report RNR-93-12, NASA Ames Report, 1993.
13. H. D. Siomn. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2:135-148, 1991.
14. R. D. Williams. Unification of spectral and inertial bisection. Technical report, CalTech, 1994. Available at http://www.cacr.caltech.edu/roy/papers.
15. C. Xu and F. Lau. Load Balancing in Parallel Computers: Theory and Practice. Kluwer Academic Publishers, November 1996.