{"id":"https://openalex.org/W3147141169","doi":"https://doi.org/10.1109/ipdps.2006.1639362","title":"Fast distributed graph partition and application","display_name":"Fast distributed graph partition and application","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W3147141169","doi":"https://doi.org/10.1109/ipdps.2006.1639362","mag":"3147141169"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel &amp; Distributed Processing Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108489901","display_name":"Bilel Derbel","orcid":null},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"B. Derbel","raw_affiliation_strings":["LaBRI, Universit\u00e9 Bordeaux 1, Talence, France"],"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 Bordeaux 1, Talence, France","institution_ids":["https://openalex.org/I4210142254","https://openalex.org/I15057530","https://openalex.org/I4210160189"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067540221","display_name":"Mohamed Mosbah","orcid":"https://orcid.org/0000-0001-6031-4237"},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Mosbah","raw_affiliation_strings":["LaBRI, Universit\u00e9 Bordeaux 1, Talence, France"],"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 Bordeaux 1, Talence, France","institution_ids":["https://openalex.org/I4210142254","https://openalex.org/I15057530","https://openalex.org/I4210160189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084035589","display_name":"Akka Zemmari","orcid":"https://orcid.org/0000-0002-9776-0449"},"institutions":[{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Zemmari","raw_affiliation_strings":["LaBRI, Universit\u00e9 Bordeaux 1, Talence, France"],"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 Bordeaux 1, Talence, France","institution_ids":["https://openalex.org/I4210142254","https://openalex.org/I15057530","https://openalex.org/I4210160189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108489901"],"corresponding_institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.38899986,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":null,"first_page":"10 pp.","last_page":"10 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/sublinear-function","display_name":"Sublinear function","score":0.8857792615890503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6880123019218445},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6327886581420898},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5621926784515381},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5531991124153137},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5500518083572388},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5235202312469482},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.492362380027771},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4919164180755615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4539475440979004},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44986534118652344},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4070320725440979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3763764202594757},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35111939907073975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.258324533700943},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2060156762599945}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8857792615890503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6880123019218445},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6327886581420898},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5621926784515381},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5531991124153137},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5500518083572388},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5235202312469482},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.492362380027771},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4919164180755615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4539475440979004},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44986534118652344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4070320725440979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3763764202594757},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35111939907073975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.258324533700943},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2060156762599945}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel &amp; Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1489660296","https://openalex.org/W1535610684","https://openalex.org/W1573935709","https://openalex.org/W1574233320","https://openalex.org/W1843916336","https://openalex.org/W1977066974","https://openalex.org/W1989381030","https://openalex.org/W1996066664","https://openalex.org/W1996879666","https://openalex.org/W2002041206","https://openalex.org/W2005580106","https://openalex.org/W2015819397","https://openalex.org/W2030104206","https://openalex.org/W2041167985","https://openalex.org/W2042333226","https://openalex.org/W2054910423","https://openalex.org/W2075459377","https://openalex.org/W2092534058","https://openalex.org/W2093455937","https://openalex.org/W2097747425","https://openalex.org/W2112009244","https://openalex.org/W2118991742","https://openalex.org/W2126251084","https://openalex.org/W2150175627","https://openalex.org/W2293001982","https://openalex.org/W4205300528","https://openalex.org/W4245082111","https://openalex.org/W6629239898"],"related_works":["https://openalex.org/W3102961801","https://openalex.org/W1531571111","https://openalex.org/W2123112061","https://openalex.org/W2982699376","https://openalex.org/W4288264556","https://openalex.org/W2967413145","https://openalex.org/W4245591796","https://openalex.org/W2009179299","https://openalex.org/W2125986699","https://openalex.org/W4385317418"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"efficient":[3,73],"deterministic":[4,92],"and":[5,26,55],"randomized":[6],"distributed":[7,38,93],"algorithms":[8,31,53,71],"for":[9],"decomposing":[10],"a":[11,17,82,90,97],"graph":[12,77,98],"with":[13,23,105],"n":[14],"nodes":[15],"into":[16],"disjoint":[18],"set":[19],"of":[20,41,51,69,75,100],"connected":[21],"clusters":[22],"small":[24],"radius":[25],"few":[27],"intercluster":[28],"edges.":[29],"Our":[30],"can":[32],"be":[33],"easily":[34],"implemented":[35],"in":[36,114],"the":[37,48,115],"CONGEST":[39,116],"model":[40,117],"computation":[42],"i.e.,":[43],"limited":[44],"message":[45],"size,":[46],"improving":[47],"time":[49],"complexity":[50],"previous":[52],"(Moran":[54],"Snir,":[56],"2000;":[57],"Awerbuch,":[58],"1985;":[59],"Peleg,":[60],"2000)":[61],"from":[62],"linear":[63],"to":[64],"sublinear.":[65],"One":[66],"important":[67],"application":[68],"our":[70],"is":[72],"construction":[74],"sparse":[76],"spanners.":[78],"In":[79],"fact,":[80],"given":[81],"parameter":[83],"k,":[84],"we":[85],"show":[86],"that":[87,95],"there":[88],"exists":[89],"sublinear":[91],"algorithm":[94],"constructs":[96],"spanner":[99],"stretch":[101],"2k":[102],"-":[103],"1":[104],"at":[106],"most":[107],"O(n":[108],"<sup":[109],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[110],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1+1</sup>":[111],"k/)":[112],"edges":[113]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}