Graph Partitioning with Natural Cuts
We present a novel approach to graph partitioning based on the notion of cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general struct...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1146 |
|---|---|
| container_issue | |
| container_start_page | 1135 |
| container_title | |
| container_volume | |
| creator | Delling, D. Goldberg, A. V. Razenshteyn, I. Werneck, R. F. |
| description | We present a novel approach to graph partitioning based on the notion of cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general structure. The second phase uses a combination of greedy and local search heuristics to assemble the final partition. The algorithm performs especially well on road networks, which have an abundance of natural cuts (such as bridges, mountain passes, and ferries). In a few minutes, it obtains the best known partitions for continental-sized networks, significantly improving on previous results. |
| doi_str_mv | 10.1109/IPDPS.2011.108 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6012851</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6012851</ieee_id><sourcerecordid>6012851</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1308-e3b121f45152c1447d6781184c13a5d8e7518b3194d441a6fa2a3bd93de493213</originalsourceid><addsrcrecordid>eNotz8FLwzAYhvHIFJyzVy9eeti1NW--JF9ylKpzMLSgnke6pi4w52g7xP9eQU_P7QePEFeQJSD9zbK-q19KJYES0p2IzLOTbL3R5AxPxAUslNPEik_FFIZkoSSbc5ENQ2qksmxZOzMV80UfDtu8Dv2YxvS5T_v3_CuN2_wpjMc-7PLqOA6X4qwLuyFm_52Jt4f71-qxWD0vltXtqkgg6YpIDRQ6bWDUBlpza9kBTm9AwbQusoFrCF63WiPYLqhATeupjdqTAs3E9Z-bYozrQ58-Qv-9tvJ3xYB-AM92QBo</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Graph Partitioning with Natural Cuts</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Delling, D. ; Goldberg, A. V. ; Razenshteyn, I. ; Werneck, R. F.</creator><creatorcontrib>Delling, D. ; Goldberg, A. V. ; Razenshteyn, I. ; Werneck, R. F.</creatorcontrib><description>We present a novel approach to graph partitioning based on the notion of cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general structure. The second phase uses a combination of greedy and local search heuristics to assemble the final partition. The algorithm performs especially well on road networks, which have an abundance of natural cuts (such as bridges, mountain passes, and ferries). In a few minutes, it obtains the best known partitions for continental-sized networks, significantly improving on previous results.</description><identifier>ISSN: 1530-2075</identifier><identifier>ISBN: 1612843727</identifier><identifier>ISBN: 9781612843728</identifier><identifier>EISBN: 9780769543857</identifier><identifier>EISBN: 0769543855</identifier><identifier>DOI: 10.1109/IPDPS.2011.108</identifier><language>eng</language><publisher>IEEE</publisher><subject>Assembly ; Contracts ; Greedy algorithms ; Image edge detection ; Partitioning algorithms ; Radiation detectors ; Roads</subject><ispartof>2011 IEEE International Parallel & Distributed Processing Symposium, 2011, p.1135-1146</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6012851$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6012851$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Delling, D.</creatorcontrib><creatorcontrib>Goldberg, A. V.</creatorcontrib><creatorcontrib>Razenshteyn, I.</creatorcontrib><creatorcontrib>Werneck, R. F.</creatorcontrib><title>Graph Partitioning with Natural Cuts</title><title>2011 IEEE International Parallel & Distributed Processing Symposium</title><addtitle>ipdps</addtitle><description>We present a novel approach to graph partitioning based on the notion of cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general structure. The second phase uses a combination of greedy and local search heuristics to assemble the final partition. The algorithm performs especially well on road networks, which have an abundance of natural cuts (such as bridges, mountain passes, and ferries). In a few minutes, it obtains the best known partitions for continental-sized networks, significantly improving on previous results.</description><subject>Assembly</subject><subject>Contracts</subject><subject>Greedy algorithms</subject><subject>Image edge detection</subject><subject>Partitioning algorithms</subject><subject>Radiation detectors</subject><subject>Roads</subject><issn>1530-2075</issn><isbn>1612843727</isbn><isbn>9781612843728</isbn><isbn>9780769543857</isbn><isbn>0769543855</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotz8FLwzAYhvHIFJyzVy9eeti1NW--JF9ylKpzMLSgnke6pi4w52g7xP9eQU_P7QePEFeQJSD9zbK-q19KJYES0p2IzLOTbL3R5AxPxAUslNPEik_FFIZkoSSbc5ENQ2qksmxZOzMV80UfDtu8Dv2YxvS5T_v3_CuN2_wpjMc-7PLqOA6X4qwLuyFm_52Jt4f71-qxWD0vltXtqkgg6YpIDRQ6bWDUBlpza9kBTm9AwbQusoFrCF63WiPYLqhATeupjdqTAs3E9Z-bYozrQ58-Qv-9tvJ3xYB-AM92QBo</recordid><startdate>201105</startdate><enddate>201105</enddate><creator>Delling, D.</creator><creator>Goldberg, A. V.</creator><creator>Razenshteyn, I.</creator><creator>Werneck, R. F.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201105</creationdate><title>Graph Partitioning with Natural Cuts</title><author>Delling, D. ; Goldberg, A. V. ; Razenshteyn, I. ; Werneck, R. F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1308-e3b121f45152c1447d6781184c13a5d8e7518b3194d441a6fa2a3bd93de493213</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Assembly</topic><topic>Contracts</topic><topic>Greedy algorithms</topic><topic>Image edge detection</topic><topic>Partitioning algorithms</topic><topic>Radiation detectors</topic><topic>Roads</topic><toplevel>online_resources</toplevel><creatorcontrib>Delling, D.</creatorcontrib><creatorcontrib>Goldberg, A. V.</creatorcontrib><creatorcontrib>Razenshteyn, I.</creatorcontrib><creatorcontrib>Werneck, R. F.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Delling, D.</au><au>Goldberg, A. V.</au><au>Razenshteyn, I.</au><au>Werneck, R. F.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Graph Partitioning with Natural Cuts</atitle><btitle>2011 IEEE International Parallel & Distributed Processing Symposium</btitle><stitle>ipdps</stitle><date>2011-05</date><risdate>2011</risdate><spage>1135</spage><epage>1146</epage><pages>1135-1146</pages><issn>1530-2075</issn><isbn>1612843727</isbn><isbn>9781612843728</isbn><eisbn>9780769543857</eisbn><eisbn>0769543855</eisbn><abstract>We present a novel approach to graph partitioning based on the notion of cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general structure. The second phase uses a combination of greedy and local search heuristics to assemble the final partition. The algorithm performs especially well on road networks, which have an abundance of natural cuts (such as bridges, mountain passes, and ferries). In a few minutes, it obtains the best known partitions for continental-sized networks, significantly improving on previous results.</abstract><pub>IEEE</pub><doi>10.1109/IPDPS.2011.108</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1530-2075 |
| ispartof | 2011 IEEE International Parallel & Distributed Processing Symposium, 2011, p.1135-1146 |
| issn | 1530-2075 |
| language | eng |
| recordid | cdi_ieee_primary_6012851 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Assembly Contracts Greedy algorithms Image edge detection Partitioning algorithms Radiation detectors Roads |
| title | Graph Partitioning with Natural Cuts |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T22%3A32%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Graph%20Partitioning%20with%20Natural%20Cuts&rft.btitle=2011%20IEEE%20International%20Parallel%20&%20Distributed%20Processing%20Symposium&rft.au=Delling,%20D.&rft.date=2011-05&rft.spage=1135&rft.epage=1146&rft.pages=1135-1146&rft.issn=1530-2075&rft.isbn=1612843727&rft.isbn_list=9781612843728&rft_id=info:doi/10.1109/IPDPS.2011.108&rft_dat=%3Cieee_6IE%3E6012851%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769543857&rft.eisbn_list=0769543855&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6012851&rfr_iscdi=true |