{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:14Z","timestamp":1773224474141,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:00:00Z","timestamp":1321056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11,12]]},"DOI":"10.1145\/2063384.2063469","type":"proceedings-article","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T13:32:09Z","timestamp":1320759129000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["A scalable eigensolver for large scale-free graphs using 2D graph partitioning"],"prefix":"10.1145","author":[{"given":"Andy","family":"Yoo","sequence":"first","affiliation":[{"name":"Center for Applied Scientific Computing, Lawrence Livermore National Laboratory"}]},{"given":"Allison H.","family":"Baker","sequence":"additional","affiliation":[{"name":"Center for Applied Scientific Computing, Lawrence Livermore National Laboratory"}]},{"given":"Roger","family":"Pearce","sequence":"additional","affiliation":[{"name":"Texas A&M University"}]},{"family":"Van Emden Henson","sequence":"additional","affiliation":[{"name":"Center for Applied Scientific Computing, Lawrence Livermore National Laboratory"}]}],"member":"320","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"16","volume-title":"Proceedings, IEEE International Parallel & Distributed Processing Symposium (IPDPS)","author":"Karypis A.","year":"2006","unstructured":"A. Abou-rjeili and G. Karypis . Multilevel algorithms for partitioning power-law graphs . In Proceedings, IEEE International Parallel & Distributed Processing Symposium (IPDPS) , pages 16 -- 575 , 2006 . A. Abou-rjeili and G. Karypis. Multilevel algorithms for partitioning power-law graphs. In Proceedings, IEEE International Parallel & Distributed Processing Symposium (IPDPS), pages 16--575, 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527286.1527287"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224227"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45209-6_7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676942"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549970_12"},{"key":"e_1_3_2_1_10_1","volume-title":"9th World Wide Web Conference","author":"Broder A.","year":"2000","unstructured":"A. Broder , R. Kumar , F. Maghoul , P. Raghavan , S. Rajagopalan , R. Stata , and A. Tomkins . Graph structure in the web: Experiments and models . In 9th World Wide Web Conference , 2000 . A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, and A. Tomkins. Graph structure in the web: Experiments and models. In 9th World Wide Web Conference, 2000."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645456.654829"},{"key":"e_1_3_2_1_12_1","first-page":"445","volume-title":"PPSC","author":"Bui T. N.","year":"1993","unstructured":"T. N. Bui and C. Jones . A heuristic for reducing fill-in in sparse matrix factorization . In PPSC , pages 445 -- 452 , 1993 . T. N. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In PPSC, pages 445--452, 1993."},{"key":"e_1_3_2_1_13_1","first-page":"118","volume-title":"Proceedings of the 15th International Parallel & Distributed Processing Symposium, IPDPS '01","author":"Catalyurek U.","unstructured":"U. Catalyurek and C. Aykanat . A fine-grain hypergraph model for 2d decomposition of sparse matrices . In Proceedings of the 15th International Parallel & Distributed Processing Symposium, IPDPS '01 , pages 118 --, Washington, DC, USA, 2001. IEEE Computer Society. U. Catalyurek and C. Aykanat. A fine-grain hypergraph model for 2d decomposition of sparse matrices. In Proceedings of the 15th International Parallel & Distributed Processing Symposium, IPDPS '01, pages 118--, Washington, DC, USA, 2001. IEEE Computer Society."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/582034.582062"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149121.1149124"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_1_19_1","volume-title":"IEEE International Conference on, 0: 0558","author":"Cooley R.","year":"1997","unstructured":"R. Cooley , B. Mobasher , and J. Srivastava . Web mining: Information and pattern discovery on the world wide web. Tools with Artificial Intelligence , IEEE International Conference on, 0: 0558 , 1997 . R. Cooley, B. Mobasher, and J. Srivastava. Web mining: Information and pattern discovery on the world wide web. Tools with Artificial Intelligence, IEEE International Conference on, 0:0558, 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/259794.259855"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620360503"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/62882.62910"},{"key":"e_1_3_2_1_24_1","volume-title":"Solving Problems on Concurrent Processors","author":"G. Fox","year":"1988","unstructured":"G. Fox et al. Solving Problems on Concurrent Processors . Prentice-Hall , 1988 . G. Fox et al. Solving Problems on Concurrent Processors. Prentice-Hall, 1988."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388998"},{"key":"e_1_3_2_1_26_1","volume-title":"Fast parallel pagerank: A linear system approach. Technical report","author":"Gleich D.","year":"2004","unstructured":"D. Gleich , L. Zhukov , and P. Berkhin . Fast parallel pagerank: A linear system approach. Technical report , Institute for Computation and Mathematical Enginneering, Stanford University , 2004 . D. Gleich, L. Zhukov, and P. Berkhin. Fast parallel pagerank: A linear system approach. Technical report, Institute for Computation and Mathematical Enginneering, Stanford University, 2004."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224487"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20417"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00048-X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224228"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129053395000051"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089019"},{"key":"e_1_3_2_1_34_1","unstructured":"Hyperion. https:\/\/hyperionproject.llnl.gov.  Hyperion. https:\/\/hyperionproject.llnl.gov."},{"key":"e_1_3_2_1_35_1","unstructured":"IBM Blue Gene\/P. www-03.ibm.com\/systems\/deepcomputing\/solutions\/bluegene.  IBM Blue Gene\/P. www-03.ibm.com\/systems\/deepcomputing\/solutions\/bluegene."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth131"},{"key":"e_1_3_2_1_39_1","volume-title":"Version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System , Version 2.0 , 1995 . G. Karypis and V. Kumar. MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0, 1995."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369103"},{"key":"e_1_3_2_1_42_1","volume-title":"PPSC","author":"Karypis G.","year":"1997","unstructured":"G. Karypis and V. Kumar . A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm . In PPSC , 1997 . G. Karypis and V. Kumar. A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm. In PPSC, 1997."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1403"},{"key":"e_1_3_2_1_44_1","volume-title":"The Bell System Technical Journal","author":"Kernighan B.","year":"1970","unstructured":"B. Kernighan and S. Lin . An efficient heuristics for partitioning graphs. Technical report , The Bell System Technical Journal , 1970 . B. Kernighan and S. Lin. An efficient heuristics for partitioning graphs. Technical report, The Bell System Technical Journal, 1970."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/360402.360406"},{"key":"e_1_3_2_1_46_1","first-page":"682","volume-title":"Scalable High-Performance Comput. Conf.","author":"Leland R.","year":"1994","unstructured":"R. Leland and B. Hendrickson . An emperical study of static load balancing algorithms . In Scalable High-Performance Comput. Conf. , pages 682 -- 685 , 1994 . R. Leland and B. Hendrickson. An emperical study of static load balancing algorithms. In Scalable High-Performance Comput. Conf., pages 682--685, 1994."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169788"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_1_49_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/3-540-62095-8_51","volume-title":"Applied Parallel Computing Industrial Computation and Optimization","author":"Maschhoff K.","year":"1996","unstructured":"K. Maschhoff and D. Sorensen . P_ARPACK: An efficient portable large scale eigenvalue package for distributed memory parallel architectures . In J. Wasniewski, J. Dongarra, K. Madsen, and D. Olesen, editors, Applied Parallel Computing Industrial Computation and Optimization , volume 1184 of Lecture Notes in Computer Science , pages 478 -- 486 . Springer Berlin\/Heidelberg , 1996 . K. Maschhoff and D. Sorensen. P_ARPACK: An efficient portable large scale eigenvalue package for distributed memory parallel architectures. In J. Wasniewski, J. Dongarra, K. Madsen, and D. Olesen, editors, Applied Parallel Computing Industrial Computation and Optimization, volume 1184 of Lecture Notes in Computer Science, pages 478--486. Springer Berlin\/Heidelberg, 1996."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1054"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00124-y"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_1_54_1","unstructured":"F. Pellegrini. Software package and libraries for sequential and parallel graph partitioning static mapping and sparse matrix block ordering and sequential mesh and hypergraph partitioning. http:\/\/www.labri.fr\/perso\/pelegrin\/scotch\/.  F. Pellegrini. Software package and libraries for sequential and parallel graph partitioning static mapping and sparse matrix block ordering and sequential mesh and hypergraph partitioning. http:\/\/www.labri.fr\/perso\/pelegrin\/scotch\/."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/331532.331562"},{"key":"e_1_3_2_1_56_1","unstructured":"Portable Extensible Toolkit for Scientific Computation. http:\/\/www.mcs.anl.gov\/petsc\/petsc-as.  Portable Extensible Toolkit for Scientific Computation. http:\/\/www.mcs.anl.gov\/petsc\/petsc-as."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611030"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Y.","year":"2003","unstructured":"Y. Saad . Iterative Methods for Sparse Linear Systems . Society for Industrial and Applied Mathematics , 2 nd edition, 2003 . Y. Saad. Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, 2nd edition, 2003.","edition":"2"},{"key":"e_1_3_2_1_60_1","volume-title":"A Handbook","author":"Scott J.","year":"1991","unstructured":"J. Scott . Social Network Analysis : A Handbook . SAGE Publications , London, UK , 1991 . J. Scott. Social Network Analysis: A Handbook. SAGE Publications, London, UK, 1991."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/0956-0521(91)90014-V"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1731022.1731031"},{"key":"e_1_3_2_1_63_1","unstructured":"The Graph500. http:\/\/www.graph500.org.  The Graph500. http:\/\/www.graph500.org."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.12.006"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.4"},{"key":"e_1_3_2_1_68_1","volume-title":"Parallel massive scale-free graph generators","author":"Yoo A.","year":"2010","unstructured":"A. Yoo and K. Henderson . Parallel massive scale-free graph generators , 2010 . http:\/\/arxiv.org\/pdf\/1003.3684v1. A. Yoo and K. Henderson. Parallel massive scale-free graph generators, 2010. http:\/\/arxiv.org\/pdf\/1003.3684v1."}],"event":{"name":"SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Seattle Washington","acronym":"SC '11","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"]},"container-title":["Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063469","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063384.2063469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:08Z","timestamp":1750241168000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,12]]},"references-count":63,"alternative-id":["10.1145\/2063384.2063469","10.1145\/2063384"],"URL":"https:\/\/doi.org\/10.1145\/2063384.2063469","relation":{},"subject":[],"published":{"date-parts":[[2011,11,12]]},"assertion":[{"value":"2011-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}