{"id":"https://openalex.org/W1488210566","doi":"https://doi.org/10.1007/978-3-662-43352-2_15","title":"Distributed Vertex-Cut Partitioning","display_name":"Distributed Vertex-Cut Partitioning","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1488210566","doi":"https://doi.org/10.1007/978-3-662-43352-2_15","mag":"1488210566"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-43352-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43352-2_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01287742","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073721299","display_name":"Fatemeh Rahimian","orcid":"https://orcid.org/0000-0003-4877-0875"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]},{"id":"https://openalex.org/I2800780207","display_name":"Swedish Institute","ror":"https://ror.org/022w3f533","country_code":"SE","type":"government","lineage":["https://openalex.org/I2800780207"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Fatemeh Rahimian","raw_affiliation_strings":["KTH - Royal Institute of Technology, Stockholm, Sweden","Swedish Institute of Computer Science, Stockholm, Sweden","KTH  - KTH Royal Institute of Technology [Stockholm] (SE-100 44, Stockholm, Sweden - Sweden)","SICS - Swedish Institute of Computer Science [Stockholm] (Stockholm Sweden  - Sweden)"],"affiliations":[{"raw_affiliation_string":"KTH - Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Swedish Institute of Computer Science, Stockholm, Sweden","institution_ids":["https://openalex.org/I2800780207"]},{"raw_affiliation_string":"KTH  - KTH Royal Institute of Technology [Stockholm] (SE-100 44, Stockholm, Sweden - Sweden)","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"SICS - Swedish Institute of Computer Science [Stockholm] (Stockholm Sweden  - Sweden)","institution_ids":["https://openalex.org/I2800780207"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012596151","display_name":"Amir H. Payberah","orcid":"https://orcid.org/0000-0002-2748-8929"},"institutions":[{"id":"https://openalex.org/I2800780207","display_name":"Swedish Institute","ror":"https://ror.org/022w3f533","country_code":"SE","type":"government","lineage":["https://openalex.org/I2800780207"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Amir H. Payberah","raw_affiliation_strings":["Swedish Institute of Computer Science, Stockholm, Sweden","SICS - Swedish Institute of Computer Science [Stockholm] (Stockholm Sweden  - Sweden)"],"affiliations":[{"raw_affiliation_string":"Swedish Institute of Computer Science, Stockholm, Sweden","institution_ids":["https://openalex.org/I2800780207"]},{"raw_affiliation_string":"SICS - Swedish Institute of Computer Science [Stockholm] (Stockholm Sweden  - Sweden)","institution_ids":["https://openalex.org/I2800780207"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041411651","display_name":"\u0160ar\u016bnas Girdzijauskas","orcid":"https://orcid.org/0000-0003-4516-7317"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sarunas Girdzijauskas","raw_affiliation_strings":["KTH - Royal Institute of Technology, Stockholm, Sweden","KTH  - KTH Royal Institute of Technology [Stockholm] (SE-100 44, Stockholm, Sweden - Sweden)"],"affiliations":[{"raw_affiliation_string":"KTH - Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"KTH  - KTH Royal Institute of Technology [Stockholm] (SE-100 44, Stockholm, Sweden - Sweden)","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090695078","display_name":"Seif Haridi","orcid":"https://orcid.org/0000-0002-6718-0144"},"institutions":[{"id":"https://openalex.org/I2800780207","display_name":"Swedish Institute","ror":"https://ror.org/022w3f533","country_code":"SE","type":"government","lineage":["https://openalex.org/I2800780207"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Seif Haridi","raw_affiliation_strings":["Swedish Institute of Computer Science, Stockholm, Sweden","SICS - Swedish Institute of Computer Science [Stockholm] (Stockholm Sweden  - Sweden)"],"affiliations":[{"raw_affiliation_string":"Swedish Institute of Computer Science, Stockholm, Sweden","institution_ids":["https://openalex.org/I2800780207"]},{"raw_affiliation_string":"SICS - Swedish Institute of Computer Science [Stockholm] (Stockholm Sweden  - Sweden)","institution_ids":["https://openalex.org/I2800780207"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5073721299"],"corresponding_institution_ids":["https://openalex.org/I2800780207","https://openalex.org/I86987016"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":3.9476,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.96276343,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"186","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7109115719795227},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.6723942756652832},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.661146879196167},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5949558019638062},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5833491683006287},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4583958387374878},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.4419187903404236},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3580634593963623},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3471706509590149},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3246074914932251},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3223488926887512},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19147664308547974}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7109115719795227},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.6723942756652832},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.661146879196167},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5949558019638062},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5833491683006287},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4583958387374878},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.4419187903404236},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3580634593963623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3471706509590149},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3246074914932251},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3223488926887512},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19147664308547974},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-43352-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43352-2_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01287742v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01287742","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"4th International Conference on Distributed Applications and Interoperable Systems (DAIS), Jun 2014, Berlin, Germany. pp.186-200, &#x27E8;10.1007/978-3-662-43352-2_15&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01287742v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01287742","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"4th International Conference on Distributed Applications and Interoperable Systems (DAIS), Jun 2014, Berlin, Germany. pp.186-200, &#x27E8;10.1007/978-3-662-43352-2_15&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1463623805","https://openalex.org/W1507811735","https://openalex.org/W1613273921","https://openalex.org/W1982003698","https://openalex.org/W1989826169","https://openalex.org/W2003365487","https://openalex.org/W2004053910","https://openalex.org/W2014875556","https://openalex.org/W2063597636","https://openalex.org/W2065769502","https://openalex.org/W2070232376","https://openalex.org/W2077240465","https://openalex.org/W2085227872","https://openalex.org/W2095212639","https://openalex.org/W2112614709","https://openalex.org/W2112882545","https://openalex.org/W2117271622","https://openalex.org/W2118953734","https://openalex.org/W2128479026","https://openalex.org/W2130822890","https://openalex.org/W2131183411","https://openalex.org/W2131975293","https://openalex.org/W2146591355","https://openalex.org/W2151107368","https://openalex.org/W2159741581","https://openalex.org/W2162136000","https://openalex.org/W2164625805","https://openalex.org/W2169647400","https://openalex.org/W2189465200","https://openalex.org/W2225559300","https://openalex.org/W2483265813","https://openalex.org/W2963577143","https://openalex.org/W3103071483","https://openalex.org/W4231530069","https://openalex.org/W4231671578","https://openalex.org/W4235055635","https://openalex.org/W4246565613"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2084470113","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803"],"abstract_inverted_index":{"Graph":[0],"processing":[1,78],"has":[2,55],"become":[3],"an":[4,113],"integral":[5],"part":[6],"of":[7,16,50,65,97,117,156,180],"big":[8],"data":[9],"analytics.":[10],"With":[11],"the":[12,17,66,133,170],"ever":[13],"increasing":[14],"size":[15],"graphs,":[18,51],"one":[19],"needs":[20],"to":[21,119,142],"partition":[22],"them":[23],"into":[24],"smaller":[25],"clusters,":[26],"which":[27],"can":[28],"be":[29],"managed":[30],"and":[31,91,128,153,158,195],"processed":[32],"more":[33,73,196],"easily":[34],"on":[35,132,150],"multiple":[36],"machines":[37],"in":[38,63,173],"a":[39,89,101,105,187],"distributed":[40,92],"fashion.":[41],"While":[42],"there":[43],"exist":[44],"numerous":[45],"solutions":[46,172],"for":[47,58,77,94,125],"edge-cut":[48],"partitioning":[49,96],"very":[52],"little":[53],"effort":[54],"been":[56],"made":[57],"vertex-cut":[59,95,188],"partitioning.":[60,135,202],"This":[61],"is":[62,104,190],"spite":[64],"fact":[67],"that":[68,109,167,174,189],"vertex-cuts":[69],"are":[70],"proved":[71],"significantly":[72],"effective":[74],"than":[75,192,197,200],"edge-cuts":[76],"most":[79],"real":[80],"world":[81],"graphs.":[82,99],"In":[83,100],"this":[84,126],"paper":[85],"we":[86,137],"present":[87],"Ja-be-Ja-vc,":[88],"parallel":[90],"algorithm":[93,108],"large":[98],"nutshell,":[102],"Ja-be-Ja-vc":[103,168],"local":[106,144],"search":[107],"iteratively":[110],"improves":[111],"upon":[112],"initial":[114],"random":[115,201],"assignment":[116],"edges":[118],"partitions.":[120],"We":[121,146,165],"propose":[122],"several":[123],"heuristics":[124],"optimization":[127],"study":[129],"their":[130],"impact":[131],"final":[134],"Moreover,":[136],"employ":[138],"simulated":[139],"annealing":[140],"technique":[141],"escape":[143],"optima.":[145],"evaluate":[147],"our":[148],"solution":[149],"various":[151],"graphs":[152],"with":[154],"variety":[155],"settings,":[157],"compare":[159],"it":[160,175],"against":[161],"two":[162],"state-of-the-art":[163],"solutions.":[164],"show":[166],"outperforms":[169],"existing":[171],"not":[176],"only":[177],"creates":[178],"partitions":[179],"any":[181],"requested":[182],"size,":[183],"but":[184],"also":[185],"requires":[186],"better":[191,199],"its":[193],"counterparts":[194],"70%":[198]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
