Multilevel algorithms for partitioning power-law graphs

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Abou Rjeili, Amine ^a   Karypis, George ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; NATURAL SCIENCES COMPUTING; PARALLEL PROCESSING SYSTEMS;

CLUSTERING-BASED COARSENING; GRAPH PARTITIONING; POWER-LAW CURVE; UNSTRUCTURED COMPUTATIONS;

GRAPH THEORY;

EID: 33847103633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639360     Document Type: Conference Paper

References (29)

1. C. Ashcraft and J. Liu. Using domain decomposition to find graph bisectors. Technical report, York University, North York, Ontario, Canada, 1995.
2. 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.
3. U. Catalyurek and C. Aykanat. Hypergraph-partitioning based decomposition for parallel sparse-matrix vector mul tiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693, 1999.
4. J. Cong and M. L. Smith. A parallel bottom-up clustering algorithm with applications to circuit partitioning in vlsi design. In Proc. ACM/IEEE Design Automation Conference, pages 755-760, 1993.
5. R. Diekmann, B. Monien, and R. Preis. Using helpful sets to improve graph bisections. In D. Hsu, A. Rosenberg, and D. Sotteau, editors, Interconnection Networks and Mapping and Scheduling Parallel Computations, volume 21, pages 57-73. AMS Publications, DIMACS Volume Series, 1995.
6. R.O. Duda, P.E. Hart, and D.G. Stork. Pattern Classification. John Wiley & Sons, 2001.
7. 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.
8. H. Gabow. Data structures for weighted matching and nearest common ancestors with linking. In Proc. of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 434-443, 1990.
9. Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar. Introduction to Parallel Computing: Design and Analysis of Algorithms, 2nd Edition. Adison Wesley Publishing Company, Redwood City, CA, 2003.
10. W. Hager, S. Park, and T. Davis. Block exchange in graph partitioning. In P. Pardalos, editor, Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer Academic Publishers, 1999.
11. S. Hauck and G. Borriello. An evaluation of bipartitioning technique. In Proc. Chapel Hill Conference on Advanced Research in VLSI, 1995.
12. B. Hendrickson. Graph partitioning and parallel solvers: Has the emperor no clothes? In Proc. Irregular'98, pages 218-225, 1998.
13. Bruce Hendrickson and Robert Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Laboratories, 1993.
14. Bruce Hendrickson and Robert Leland. The chaco user's guide, version 2.0. Technical Report SAND94-2692, Sandia National Laboratories, 1994.
15. G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Proceedings of Supercomputing, 1995.
16. G. Karypis and V. Kumar. Technical report, Department of Computer Science, University of Minnesota, 1998.
17. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359-392, 1998.
18. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998.
19. G. Karypis and V. Kumar. A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1), 1999.
20. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
21. J. Kleinberg. Authoritative sources in a hyperlinked environment. In Proc. of the Nineth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.
22. R. Tanaka J.C. Doyle W. Willinger L. Li, D. Alderson. Towards a theory of scale-free graphs: Definition, properties, and implications. Technical Report CIT-CDS-04-006, California Institute of Technology, Pasadena, CA, 2004.
23. R. Motwani T. Winograd L. Page, S. Brin. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
24. B. Monien, R. Preis, and R. Diekmann. Quality matching and local improvement for multilevel graph-partitioning. Technical report, University of Paderborn, 1999.
25. F. Pellegrini and J. Roman. SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. HPCN-Europe, Springer LNCS 1067, pages 493-498, 1996.
26. Seidman S.B. Network structure and minimum degree. Social Networks, 5:269-287, 1983.
27. Kirk Schloegel, George Karypis, and Vipin Kumar. Graph partitioning for high-performance scientific simulations. In Jack Dongara, Ian Foster, Geoffrey Fox, William Gropp, Ken Kennedy, Linda Torczon, and Andy White, editors, Source-book on Parallel. Computing, chapter 18, pages 491-541. Morgan Kaufmann, San Francisco, CA, 2002.
28. M. Zaveršnik V. Batagelj. An O(m) algorithm for cores decomposition of networks.
29. M. Zaveršnik V. Batagelj. Generalized cores. Journal of the ACM, V(N):1-8, 2002.