{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/parallel-graph-partitioning-for-complex","title":"Parallel Graph Partitioning for Complex Networks","arxiv_id":"1404.4797","date":"2014-04-18","proceeding":null,"authors":["Henning Meyerhenke","Peter Sanders","Christian Schulz"],"abstract":"Processing large complex networks like social networks or web graphs has\nrecently attracted considerable interest. In order to do this in parallel, we\nneed to partition them into pieces of about equal size. Unfortunately, previous\nparallel graph partitioners originally developed for more regular mesh-like\nnetworks do not work well for these networks. This paper addresses this problem\nby parallelizing and adapting the label propagation technique originally\ndeveloped for graph clustering. By introducing size constraints, label\npropagation becomes applicable for both the coarsening and the refinement phase\nof multilevel graph partitioning. We obtain very high quality by applying a\nhighly parallel evolutionary algorithm to the coarsened graph. The resulting\nsystem is both more scalable and achieves higher quality than state-of-the-art\nsystems like ParMetis or PT-Scotch. For large complex networks the performance\ndifferences are very big. For example, our algorithm can partition a web graph\nwith 3.3 billion edges in less than sixteen seconds using 512 cores of a high\nperformance cluster while producing a high quality partition -- none of the\ncompeting systems can handle this graph on our system.","url_abs":"http://arxiv.org/abs/1404.4797v3","url_pdf":"http://arxiv.org/pdf/1404.4797v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"parallel-graph-partitioning-for-complex","repo_url":"https://github.com/KaHIP/KaHIP","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"graph-partitioning","task_name":"graph partitioning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"KaHIP/KaHIP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"dfd78d31cef335a13e0db100f8d1b7146a7699605d3c731e8d46fe2dc7b8f56b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}