Sublinear Fully Distributed Partition with Applications
We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k −1 and having O ( n 1+1/ k ) intercluster edges. We show how to implement our algorithms in the distributed model of compu...
Uložené v:
| Vydané v: | Theory of computing systems Ročník 47; číslo 2; s. 368 - 404 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer-Verlag
01.08.2010
Springer Nature B.V Springer Verlag |
| Predmet: | |
| ISSN: | 1432-4350, 1433-0490 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with
n
nodes into a disjoint set of connected clusters with radius at most
k
−1 and having
O
(
n
1+1/
k
) intercluster edges. We show how to implement our algorithms in the distributed
model of computation, i.e., limited message size, which improves the time complexity of previous algorithms (Moran and Snir in Theor. Comput. Sci. 243(1–2):217–241,
2000
; Awerbuch in J. ACM 32:804–823,
1985
; Peleg in Distributed Computing: A Locality-Sensitive Approach,
2000
) from
O
(
n
) to
O
(
n
1−1/
k
). We apply our algorithms for constructing low stretch graph spanners and network synchronizers in sublinear deterministic time in the
model. |
|---|---|
| AbstractList | We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with $n$ nodes into a disjoint set of connected clusters with radius at most $k-1$ and having $O(n^{1+1/k})$ intercluster edges. We show how to implement our algorithms in the distributed $\mathcal{CONGEST}$ model of computation, i.e., limited message size, which improves the time complexity of previous algorithms~\cite{MS00,Awe85,Peleg00b} from $O(n)$ to $O(n^{1-1/k})$. We apply our algorithms for constructing low stretch graph spanners and network synchronizers in sublinear deterministic time in the $\mathcal{CONGEST}$ model. We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k −1 and having O ( n 1+1/ k ) intercluster edges. We show how to implement our algorithms in the distributed model of computation, i.e., limited message size, which improves the time complexity of previous algorithms (Moran and Snir in Theor. Comput. Sci. 243(1–2):217–241, 2000 ; Awerbuch in J. ACM 32:804–823, 1985 ; Peleg in Distributed Computing: A Locality-Sensitive Approach, 2000 ) from O ( n ) to O ( n 1−1/ k ). We apply our algorithms for constructing low stretch graph spanners and network synchronizers in sublinear deterministic time in the model. We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k-1 and having O(n super(1+1/)k intercluster edges. We show how to implement our algorithms in the distributed $\mathcal{CONGEST}$ model of computation, i.e., limited message size, which improves the time complexity of previous algorithms(Moran and Snir in Theor. Comput. Sci. 243(1-2):217-241, 2000; Awerbuch in J. ACM 32:804-823, 1985; Peleg in Distributed Computing: A Locality-Sensitive Approach, 2000) from O(n) to O(n super(1-1/)k. We apply our algorithms for constructing low stretch graph spanners and network synchronizers in sublinear deterministic time in the $\mathcal{CONGEST}$ model. We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k-1 and having O(n ^sup 1+1/k^) intercluster edges. We show how to implement our algorithms in the distributed CONGEST model of computation, i.e., limited message size, which improves the time complexity of previous algorithms (Moran and Snir in Theor. Comput. Sci. 243(1-2):217-241, 2000; Awerbuch in J. ACM 32:804-823, 1985; Peleg in Distributed Computing: A Locality-Sensitive Approach, 2000) from O(n) to O(n ^sup 1-1/k^). We apply our algorithms for constructing low stretch graph spanners and network synchronizers in sublinear deterministic time in the CONGEST model.[PUBLICATION ABSTRACT] |
| Author | Zemmari, Akka Derbel, Bilel Mosbah, Mohamed |
| Author_xml | – sequence: 1 givenname: Bilel surname: Derbel fullname: Derbel, Bilel organization: LIFL, INRIA, Université des Sciences et Technologies de Lille Bâtiment M3 – sequence: 2 givenname: Mohamed surname: Mosbah fullname: Mosbah, Mohamed email: mosbah@labri.fr organization: LaBRI, Université Bordeaux I, ENSEIRB – sequence: 3 givenname: Akka surname: Zemmari fullname: Zemmari, Akka organization: LaBRI, Université Bordeaux I, ENSEIRB |
| BackLink | https://hal.science/hal-00351045$$DView record in HAL |
| BookMark | eNp9kEFLxDAQhYMoqKs_wFvxpIfqJE3a5risrgoLCuo5pGmikdiuSarrv7fdKsKCnmYYvje89_bRdtM2GqEjDGcYoDgPAITQFICnHHNIV1toD9MsS4Fy2F7vJKUZg120H8ILAGQlwB4q7rvK2UZLn8w75z6TCxuit1UXdZ3cSR9ttG2TfNj4nEyXS2eVHA7hAO0Y6YI-_J4T9Di_fJhdp4vbq5vZdJGqrCQx5YrWgJmqec4KYirgGkzFKgmK5JJTplSd14UxlFQYF1wagxmVlNTMQKVwNkGn499n6cTS21fpP0UrrbieLsRw64MwDJS9D-zJyC59-9bpEMWrDUo7JxvddkHgvMCk91GSHj3eQF_azjd9ElHSAjPCOO2hYoSUb0Pw2ghl4zp-9NI6gUEM3Yux-94JF0P3YtUr8Ybyx_p_GjJqQs82T9r_Wvpb9AWfQJeh |
| CODEN | TCSYFI |
| CitedBy_id | crossref_primary_10_1007_s00446_018_0343_5 crossref_primary_10_1016_j_ic_2010_07_001 crossref_primary_10_1137_20M1312630 crossref_primary_10_1007_s00446_020_00376_1 |
| Cites_doi | 10.1137/S0097539700369740 10.1145/4221.4227 10.1007/3-540-45061-0_32 10.1137/0221015 10.1016/S0020-0190(01)00289-7 10.1016/S0304-3975(98)00206-0 10.1016/S0020-0190(00)00118-6 10.1016/S0196-6774(02)00292-4 10.1006/jagm.1993.1016 10.1007/BF01294595 10.1007/11549345_19 10.1137/0405013 10.1006/jpdc.2001.1811 10.1007/BF02189308 10.1137/S0097539794271898 10.1137/S0097539794261118 10.1137/S0097539701393384 10.1145/210118.210132 10.1137/S0097539794261295 10.1007/s00224-003-1062-1 10.1006/jpdc.1996.0159 10.1006/jagm.1998.0929 10.1109/FOCS.2006.45 10.1137/1.9780898719772 10.1145/1400751.1400786 10.1142/9789812814951_0001 10.1007/978-3-540-73420-8_9 10.1145/1109557.1109645 10.1145/1400751.1400788 10.1109/FSCS.1990.89572 10.1007/11523468_22 10.1109/SFCS.1989.63504 10.1145/129712.129769 10.1007/BFb0020436 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC 2009 Springer Science+Business Media, LLC 2010 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Springer Science+Business Media, LLC 2009 – notice: Springer Science+Business Media, LLC 2010 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L.0 L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U 1XC |
| DOI | 10.1007/s00224-009-9190-x |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Collection (ProQuest) ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database Engineering Database ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest One Academic ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ABI/INFORM Collection China ProQuest Central Basic Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Professional Standard ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Computer and Information Systems Abstracts ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1433-0490 |
| EndPage | 404 |
| ExternalDocumentID | oai:HAL:hal-00351045v1 2247891411 10_1007_s00224_009_9190_x |
| Genre | Feature |
| GroupedDBID | --Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 2.D 203 29Q 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8V8 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADPHR ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D0L DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ3 GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- MK~ ML~ NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF- PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R89 R9I RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XOL YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~8M AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L.0 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U PUEGO 1XC |
| ID | FETCH-LOGICAL-c382t-9c4d015cd96572fb09e0fb5ba0c26a945ccd6d7ff42b1179aff154a42d5f0bc13 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000278029300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1432-4350 |
| IngestDate | Sat Nov 29 15:03:14 EST 2025 Thu Oct 02 11:28:26 EDT 2025 Tue Nov 04 19:22:14 EST 2025 Sat Nov 29 03:28:53 EST 2025 Tue Nov 18 21:52:07 EST 2025 Fri Feb 21 02:34:30 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Sparse partition Distributed model Graph spanner Time complexity Distributed algorithm |
| Language | English |
| License | http://www.springer.com/tdm Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c382t-9c4d015cd96572fb09e0fb5ba0c26a945ccd6d7ff42b1179aff154a42d5f0bc13 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0001-6031-4237 0000-0002-4156-8490 |
| PQID | 847152594 |
| PQPubID | 48907 |
| PageCount | 37 |
| ParticipantIDs | hal_primary_oai_HAL_hal_00351045v1 proquest_miscellaneous_1671265782 proquest_journals_847152594 crossref_citationtrail_10_1007_s00224_009_9190_x crossref_primary_10_1007_s00224_009_9190_x springer_journals_10_1007_s00224_009_9190_x |
| PublicationCentury | 2000 |
| PublicationDate | 2010-08-01 |
| PublicationDateYYYYMMDD | 2010-08-01 |
| PublicationDate_xml | – month: 08 year: 2010 text: 2010-08-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Theory of computing systems |
| PublicationTitleAbbrev | Theory Comput Syst |
| PublicationYear | 2010 |
| Publisher | Springer-Verlag Springer Nature B.V Springer Verlag |
| Publisher_xml | – name: Springer-Verlag – name: Springer Nature B.V – name: Springer Verlag |
| References | Awerbuch, Peleg (CR7) 1992; 5 Comellas, Ozón, Peters (CR16) 2000; 76 Litovsky, Métivier, Sopena (CR31) 1995; 28 CR18 Elkin, Zhang (CR23) 2004 CR17 CR39 Awerbuch, Peleg (CR8) 1995; 42 Elkin (CR21) 2001 CR38 CR36 CR35 Elkin, Peleg (CR22) 2004; 33 Kutten, Peleg (CR28) 1998; 28 Moran, Snir (CR34) 2000; 243 Peleg, Rubinovich (CR37) 2000; 30 Baswana, Kavitha, Mehlhorn, Pettie (CR12) 2005 Linial (CR30) 1992; 21 Althofer, Das, Dobkin, Joseph, Soares (CR2) 1993; 9 Garay, Kutten, Peleg (CR25) 1998; 27 CR4 Linial (CR29) 1987 CR6 Awerbuch, Berger, Cowen, Peleg (CR9) 1996; 39 Williams (CR43) 1993 Derbel, Mosbah, Zemmari (CR19) 2006 Awerbuch, Peleg (CR5) 1990 CR27 CR44 Litovsky, Métivier, Sopena (CR32) 1999 Cohen (CR15) 1998; 28 CR20 CR42 CR41 CR40 Métivier, Saheb, Zemmari (CR33) 2002; 82 Afek, Ricklin (CR1) 1993; 14 Belkouch, Bui, Chen, Datta (CR13) 2002; 62 Chalopin, Métivier (CR14) 2005 Baswana, Sen (CR11) 2003 Awerbuch (CR3) 1985; 32 Awerbuch, Berger, Cowen, Peleg (CR10) 1998; 28 Gaber, Mansour (CR24) 2003; 46 Godard, Métivier, Muscholl (CR26) 2004; 37 M. Elkin (9190_CR23) 2004 I. Litovsky (9190_CR31) 1995; 28 E. Cohen (9190_CR15) 1998; 28 B. Awerbuch (9190_CR9) 1996; 39 S. Kutten (9190_CR28) 1998; 28 I. Gaber (9190_CR24) 2003; 46 F. Comellas (9190_CR16) 2000; 76 S. Moran (9190_CR34) 2000; 243 J. Chalopin (9190_CR14) 2005 N. Linial (9190_CR30) 1992; 21 9190_CR27 N. Linial (9190_CR29) 1987 B. Awerbuch (9190_CR3) 1985; 32 B. Awerbuch (9190_CR10) 1998; 28 9190_CR4 M. Elkin (9190_CR22) 2004; 33 B. Awerbuch (9190_CR5) 1990 9190_CR6 J.A. Garay (9190_CR25) 1998; 27 9190_CR41 9190_CR20 9190_CR42 B. Derbel (9190_CR19) 2006 E. Godard (9190_CR26) 2004; 37 9190_CR44 Y. Afek (9190_CR1) 1993; 14 F. Belkouch (9190_CR13) 2002; 62 S. Baswana (9190_CR12) 2005 9190_CR40 I. Litovsky (9190_CR32) 1999 D. Williams (9190_CR43) 1993 B. Awerbuch (9190_CR8) 1995; 42 S. Baswana (9190_CR11) 2003 M. Elkin (9190_CR21) 2001 9190_CR38 9190_CR17 9190_CR39 9190_CR18 Y. Métivier (9190_CR33) 2002; 82 I. Althofer (9190_CR2) 1993; 9 B. Awerbuch (9190_CR7) 1992; 5 9190_CR35 9190_CR36 D. Peleg (9190_CR37) 2000; 30 |
| References_xml | – volume: 30 start-page: 1427 issue: 5 year: 2000 end-page: 1442 ident: CR37 article-title: A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction publication-title: SIAM J. Comput. doi: 10.1137/S0097539700369740 – volume: 32 start-page: 804 year: 1985 end-page: 823 ident: CR3 article-title: Complexity of network synchronization publication-title: J. ACM doi: 10.1145/4221.4227 – ident: CR18 – start-page: 384 year: 2003 end-page: 396 ident: CR11 article-title: A simple linear time algorithm for computing a (2 −1)-spanner of ( ) size in weighted graphs publication-title: 30th International Colloquium on Automata, Languages and Programming (ICALP03) doi: 10.1007/3-540-45061-0_32 – volume: 21 start-page: 193 issue: 1 year: 1992 end-page: 201 ident: CR30 article-title: Locality in distributed graphs algorithms publication-title: SIAM J. Comput. doi: 10.1137/0221015 – volume: 82 start-page: 313 year: 2002 end-page: 120 ident: CR33 article-title: Randomized local elections publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(01)00289-7 – volume: 243 start-page: 217 issue: 1–2 year: 2000 end-page: 241 ident: CR34 article-title: Simple and efficient network decomposition and synchronization publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(98)00206-0 – volume: 76 start-page: 83 issue: 1–2 year: 2000 end-page: 90 ident: CR16 article-title: Deterministic small-world communication networks publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(00)00118-6 – year: 1993 ident: CR43 publication-title: Probability with Martingals – ident: CR4 – ident: CR39 – year: 2006 ident: CR19 article-title: Fast distributed graph partition and application publication-title: 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS06) – volume: 46 start-page: 1 year: 2003 end-page: 20 ident: CR24 article-title: Centralized broadcast in multihop radio networks publication-title: J. Algorithms doi: 10.1016/S0196-6774(02)00292-4 – volume: 14 start-page: 316 year: 1993 end-page: 328 ident: CR1 article-title: Sparser: a paradigm for running distributed algorithms publication-title: J. Algorithms doi: 10.1006/jagm.1993.1016 – volume: 28 start-page: 41 year: 1995 end-page: 65 ident: CR31 article-title: Different local controls for graph relabelling systems publication-title: Math. Syst. Theory doi: 10.1007/BF01294595 – start-page: 212 year: 2005 end-page: 223 ident: CR14 article-title: A bridge between the asynchronous message passing model and local computations in graphs publication-title: Mathematical Foundations of Computer Science (MFCS05) doi: 10.1007/11549345_19 – ident: CR35 – ident: CR6 – start-page: 1 year: 1999 end-page: 56 ident: CR32 article-title: Graph relabelling systems and distributed algorithms publication-title: Handbook of Graph Grammars and Computing by Graph Transformation – ident: CR40 – volume: 5 start-page: 151 year: 1992 end-page: 162 ident: CR7 article-title: Routing with polynomial communication-space trade-off publication-title: SIAM J. Discrete Math. doi: 10.1137/0405013 – volume: 62 start-page: 696 year: 2002 end-page: 714 ident: CR13 article-title: Self-stabilizing deterministic network decomposition publication-title: J. Parralel Distrib. Comput. doi: 10.1006/jpdc.2001.1811 – ident: CR27 – ident: CR42 – volume: 9 start-page: 81 year: 1993 end-page: 100 ident: CR2 article-title: On sparse spanners of weighted graphs publication-title: Discrete Comput. Geom. doi: 10.1007/BF02189308 – start-page: 160 year: 2004 end-page: 168 ident: CR23 article-title: Efficient algorithms for constructing (1+ , )-spanners in the distributed and streaming models publication-title: 23rd ACM Symposium on Principles of Distributed Computing (PODC04) – ident: CR44 – start-page: 331 year: 1987 end-page: 335 ident: CR29 article-title: Distributive graph algorithms—global solutions from local data publication-title: 28th IEEE Symposium on Foundations of Computer Science (FOCS87) – start-page: 672 year: 2005 end-page: 681 ident: CR12 article-title: New constructions of ( , )-spanners and purely additive spanners publication-title: 16th Symposium on Discrete Algorithms (SODA05) – start-page: 53 year: 2001 end-page: 62 ident: CR21 article-title: Computing almost shortest paths publication-title: 20th ACM Symposium on Principles of Distributed Computing (PODC01) – volume: 28 start-page: 263 issue: 1 year: 1998 end-page: 277 ident: CR10 article-title: Near-linear time construction of sparse neighborhood covers publication-title: SIAM J. Comput. doi: 10.1137/S0097539794271898 – ident: CR38 – volume: 27 start-page: 302 year: 1998 end-page: 316 ident: CR25 article-title: A sublinear time distributed algorithm for minimum-weight spanning trees publication-title: SIAM J. Comput. doi: 10.1137/S0097539794261118 – ident: CR17 – ident: CR36 – volume: 33 start-page: 608 issue: 3 year: 2004 end-page: 631 ident: CR22 article-title: (1+ , )-spanner constructions for general graphs publication-title: SIAM J. Comput. doi: 10.1137/S0097539701393384 – volume: 42 start-page: 1021 year: 1995 end-page: 1058 ident: CR8 article-title: Online tracking of mobile users publication-title: J. ACM doi: 10.1145/210118.210132 – volume: 28 start-page: 210 issue: 1 year: 1998 end-page: 236 ident: CR15 article-title: Fast algorithms for constructing -spanners and paths with stretch publication-title: SIAM J. Comput. doi: 10.1137/S0097539794261295 – ident: CR41 – volume: 37 start-page: 249 issue: 2 year: 2004 end-page: 293 ident: CR26 article-title: Characterizations of classes of graphs recognizable by local computations publication-title: Theory Comput. Syst. doi: 10.1007/s00224-003-1062-1 – volume: 39 start-page: 105 year: 1996 end-page: 114 ident: CR9 article-title: Fast distributed network decompositions and covers publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.1996.0159 – start-page: 503 year: 1990 end-page: 513 ident: CR5 article-title: Sparse partitions publication-title: 31th Symposium on Foundations of Computer Science (FOCS90) – ident: CR20 – volume: 28 start-page: 40 issue: 1 year: 1998 end-page: 66 ident: CR28 article-title: Fast distributed construction of small -dominating sets and applications publication-title: J. Algorithms doi: 10.1006/jagm.1998.0929 – start-page: 384 volume-title: 30th International Colloquium on Automata, Languages and Programming (ICALP03) year: 2003 ident: 9190_CR11 doi: 10.1007/3-540-45061-0_32 – start-page: 53 volume-title: 20th ACM Symposium on Principles of Distributed Computing (PODC01) year: 2001 ident: 9190_CR21 – ident: 9190_CR44 doi: 10.1109/FOCS.2006.45 – start-page: 503 volume-title: 31th Symposium on Foundations of Computer Science (FOCS90) year: 1990 ident: 9190_CR5 – volume: 39 start-page: 105 year: 1996 ident: 9190_CR9 publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.1996.0159 – ident: 9190_CR36 doi: 10.1137/1.9780898719772 – ident: 9190_CR39 doi: 10.1145/1400751.1400786 – volume: 76 start-page: 83 issue: 1–2 year: 2000 ident: 9190_CR16 publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(00)00118-6 – volume: 27 start-page: 302 year: 1998 ident: 9190_CR25 publication-title: SIAM J. Comput. doi: 10.1137/S0097539794261118 – start-page: 1 volume-title: Handbook of Graph Grammars and Computing by Graph Transformation year: 1999 ident: 9190_CR32 doi: 10.1142/9789812814951_0001 – ident: 9190_CR38 doi: 10.1007/978-3-540-73420-8_9 – ident: 9190_CR27 – volume: 82 start-page: 313 year: 2002 ident: 9190_CR33 publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(01)00289-7 – volume: 32 start-page: 804 year: 1985 ident: 9190_CR3 publication-title: J. ACM doi: 10.1145/4221.4227 – start-page: 331 volume-title: 28th IEEE Symposium on Foundations of Computer Science (FOCS87) year: 1987 ident: 9190_CR29 – volume: 28 start-page: 263 issue: 1 year: 1998 ident: 9190_CR10 publication-title: SIAM J. Comput. doi: 10.1137/S0097539794271898 – volume: 28 start-page: 210 issue: 1 year: 1998 ident: 9190_CR15 publication-title: SIAM J. Comput. doi: 10.1137/S0097539794261295 – volume: 28 start-page: 41 year: 1995 ident: 9190_CR31 publication-title: Math. Syst. Theory doi: 10.1007/BF01294595 – volume: 5 start-page: 151 year: 1992 ident: 9190_CR7 publication-title: SIAM J. Discrete Math. doi: 10.1137/0405013 – ident: 9190_CR18 – volume-title: Probability with Martingals year: 1993 ident: 9190_CR43 – volume: 42 start-page: 1021 year: 1995 ident: 9190_CR8 publication-title: J. ACM doi: 10.1145/210118.210132 – volume: 46 start-page: 1 year: 2003 ident: 9190_CR24 publication-title: J. Algorithms doi: 10.1016/S0196-6774(02)00292-4 – ident: 9190_CR17 – volume: 243 start-page: 217 issue: 1–2 year: 2000 ident: 9190_CR34 publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(98)00206-0 – volume: 28 start-page: 40 issue: 1 year: 1998 ident: 9190_CR28 publication-title: J. Algorithms doi: 10.1006/jagm.1998.0929 – ident: 9190_CR42 doi: 10.1145/1109557.1109645 – volume: 14 start-page: 316 year: 1993 ident: 9190_CR1 publication-title: J. Algorithms doi: 10.1006/jagm.1993.1016 – start-page: 160 volume-title: 23rd ACM Symposium on Principles of Distributed Computing (PODC04) year: 2004 ident: 9190_CR23 – volume: 62 start-page: 696 year: 2002 ident: 9190_CR13 publication-title: J. Parralel Distrib. Comput. doi: 10.1006/jpdc.2001.1811 – start-page: 212 volume-title: Mathematical Foundations of Computer Science (MFCS05) year: 2005 ident: 9190_CR14 doi: 10.1007/11549345_19 – volume-title: 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS06) year: 2006 ident: 9190_CR19 – volume: 9 start-page: 81 year: 1993 ident: 9190_CR2 publication-title: Discrete Comput. Geom. doi: 10.1007/BF02189308 – ident: 9190_CR20 doi: 10.1145/1400751.1400788 – start-page: 672 volume-title: 16th Symposium on Discrete Algorithms (SODA05) year: 2005 ident: 9190_CR12 – volume: 37 start-page: 249 issue: 2 year: 2004 ident: 9190_CR26 publication-title: Theory Comput. Syst. doi: 10.1007/s00224-003-1062-1 – volume: 30 start-page: 1427 issue: 5 year: 2000 ident: 9190_CR37 publication-title: SIAM J. Comput. doi: 10.1137/S0097539700369740 – ident: 9190_CR6 doi: 10.1109/FSCS.1990.89572 – volume: 21 start-page: 193 issue: 1 year: 1992 ident: 9190_CR30 publication-title: SIAM J. Comput. doi: 10.1137/0221015 – volume: 33 start-page: 608 issue: 3 year: 2004 ident: 9190_CR22 publication-title: SIAM J. Comput. doi: 10.1137/S0097539701393384 – ident: 9190_CR40 doi: 10.1007/11523468_22 – ident: 9190_CR4 doi: 10.1109/SFCS.1989.63504 – ident: 9190_CR35 doi: 10.1145/129712.129769 – ident: 9190_CR41 doi: 10.1007/BFb0020436 |
| SSID | ssj0003800 |
| Score | 1.9452552 |
| Snippet | We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with
n
nodes into a disjoint set of connected clusters... We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters... We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with $n$ nodes into a disjoint set of connected clusters... |
| SourceID | hal proquest crossref springer |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 368 |
| SubjectTerms | Algorithms Clusters Computation Computer Science Construction Decomposition Distributed processing Graphs Messages Neighborhoods Networks Other Sparsity Synchronizers Theory of Computation |
| SummonAdditionalLinks | – databaseName: ABI/INFORM Collection dbid: 7WY link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB7x6AEOQCmIFIoC6okqquPEdnyqVhTEAVYrlbbLyYrHiahUZSlZEPz7erJJCkjdC9fEcazMwxPPzPcBfLQ6V8ikixhiSi05eZTJDCOhFNqYW8sbrsMf52o4zMZjPWprc-q2rLLziY2jdhOkM_LP5EWFj9XTLzd_IiKNouRqy6CxCMt-nxZEYKB-XvWOOMmaDhQfEVBjkOiTmqzBEPWLiCgzoKmZ-uHZtrR4TUWRTyLOF0nSZu85XX_lqjdgrQ06w8FMS97CQlFtwnpH6BC29r0Jqxc9iGv9DtQ3OqKqvCmE9KP6GH4lkF3ixypcOCKVI6GGdJIbDp7kwbfg--nJ5fFZ1PIsRJhkfBppTJ2PCtBpKRQvLdMFK62wOUMuc50KRCedKsuUW0KQy8vSB155yp0omcU42YalalIVOxDKhLh8ZF5qRqEB-hkTlFynXEmFWgTAus9ssAUhJy6M36aHT24kY7xkDEnGPARw1D9yM0PgmDf40MuuH0fY2WeDc0PXmpypD2Dv4wB2O2GZ1mJr00sqgIP-rjc1yp_kVTG5q00sVcwl4f8H8KnTiH8z_HdR7-e-bxdWZhUJVFS4B0vT27viA7zB--mv-na_0ei_3e_5sw priority: 102 providerName: ProQuest |
| Title | Sublinear Fully Distributed Partition with Applications |
| URI | https://link.springer.com/article/10.1007/s00224-009-9190-x https://www.proquest.com/docview/847152594 https://www.proquest.com/docview/1671265782 https://hal.science/hal-00351045 |
| Volume | 47 |
| WOSCitedRecordID | wos000278029300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: 7WY dateStart: 20020101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: M0C dateStart: 20020101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: K7- dateStart: 20020101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: M7S dateStart: 20020101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: P5Z dateStart: 20020101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: BENPR dateStart: 20020101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1433-0490 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: M2P dateStart: 20020101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1433-0490 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT90wDLfGx4EdYDDQCuypIE5MldK0SZrjGx9CGjxVPD53iRq3FUhTmegDbf_94r62g2lDGhdLbdMosuPEie2fAXaszhQymQcMMaaUnCxIZIKBUAptyK3lTa3Di2M1GiVXVzpt87jrLtq9c0k2K3Wf7NZsNwFd5mvKf3aG45wgsBk6oo8v-uU3Spq8E2cHUDqQ6F2Zf-vi2WY0c0OhkE_szD9co82Oc7j0qrG-g8XWwPSH0xmxDG-KagWWuuINfqvLK_D2pAdsrd-DGtN1VOWmvU-H0p_-PgHqUi2sIvdTml4kQJ9ubf3hE5_3KpwfHpztHQVtTYUAo4RPAo1x7iwAzLUUipeW6YKVVtiMIZeZjgViLnNVljG3hBaXlaUzsrKY56JkFsNoDWaru6r4AL6MqG6PzErNyAxA12OEkuuYK6lQCw9Yx1yDLeA41b34Znqo5IZNxrHJEJvMDw92-1--T9E2Xmq87STWtyOc7KPhsaF3jX_UGauPoQcbnUBNq521oR1ZuHNf7MFW_9WpFflKsqq4e6hNKFXIJWH9e_Cpk_HvHv45qPX_ar0BC9NoBAoo3ITZyf1D8RHm8XFyW98PYEZdXg9g7vPBKD11T19U4OgJ2yPKU6Jq7Ggqvg4aHfgFIcn3eA |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3dT9UwFD8BNEEfBEHjxI9q8EXT2HVbuz4QcyOSS-7lhkQ0vNX1bIsmZhfZBeGP8n-kZ3cbaAJvPPi6dd26_s7pac_HD2DTmUyjUDkXiDGl5GQ8VSnyRGt0oXRONlyHX8d6MkkPD83-AvzpcmEorLLTiY2izqdIZ-TvSYsm3laPPxz94kQaRc7VjkFjjopRcf7b79jqrd1tP71vpNz5dPBxyFtSAY5RKmfcYJz7JRBzoxItSydMIUqXuEygVJmJE8Rc5bosY-moXFpWlt7KyGKZJ6VwGEa-30W4E0epIoEaad4r_ihtMl68BUKJSEnvRBVNzVI_aE6eCEPJ22d_LYOL3ykI84qF-49Ttlnrdlb-s7-0Cg9ao5oN5lLwEBaKag1WOsIK1uqvNbi_1xeprddBf6YjuMp_LqON-DnbpiLCxP9V5GyfRIpAy-ikmg2u-PkfwZdbGcxjWKqmVfEEmIqIq0hlpRFk-qDvMUIlTSy10miSAEQ3rRbbIuvE9fHT9uWhGyRYjwRLSLBnAbztHzmaVxi5qfFrj5W-HdUGHw7Glq41PmFvoJ-GAWx04LCtRqptj4wAXvV3vSoh_1BWFdOT2oZKh1IRv0EA7zoEXvZw7Uc9vfF9L2F5eLA3tuPdyWgD7s2jLyiA8hkszY5PiudwF09nP-rjF400Mfh228C8ABmYWA0 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB61W4TgQKGACOVhEFxAUR0nseMDQgvbVasuqxWPqjcTT2KBhLKl2Zb2p_Hv8GSTUJDorQeuieMk9ueZsefxATyzOlfIZRFyxIRScvIwkxmGqVJoI2GtaLgO9ydqOs0ODvRsBX52uTAUVtnJxEZQF3OkM_ItkqKpt9WTLddGRcxG49eH30MikCJHa8emsUTIXnn2w-_e6le7Iz_Vz4UYb398uxO2BAMhxplYhBqTwqtDLLRMlXCW65I7m9qco5C5TlLEQhbKuURYKp2WO-ctjjwRReq4xSj2_a7Cmor9nmcAa2-2p7P3vRqIsyb_xdsjlJaU9i5V3lQw9UMQkl9CUyr36R9KcfULhWSes3f_ctE2mm-8_h-P2U240ZrbbLhcH7dgpaw2YL2jsmCtZNuA6-_68rX1bVAf6HCu8p_LaIt-xkZUXpiYwcqCzWixEZwZnWGz4bkIgDvw6VJ-5i4MqnlV3gMmY2IxkrnTnIwi9D3GKIVOhJIKdRoA76bYYFt-nVhAvpm-cHSDCuNRYQgV5jSAF_0jh8vaIxc1fupx07ejquE7w4mha4232JvuJ1EAmx1QTCuratOjJIAn_V0vZMhzlFfl_Lg2kVSRkMR8EMDLDo2_e_jnR92_8H2P4arHo5nsTvc24doyLIMiKx_AYHF0XD6EK3iy-FofPWqXFoPPl43MX2BwYl8 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Sublinear+Fully+Distributed+Partition+with+Applications&rft.jtitle=Theory+of+computing+systems&rft.au=Derbel%2C+Bilel&rft.au=Mosbah%2C+Mohamed&rft.au=Zemmari%2C+Akka&rft.date=2010-08-01&rft.pub=Springer-Verlag&rft.issn=1432-4350&rft.eissn=1433-0490&rft.volume=47&rft.issue=2&rft.spage=368&rft.epage=404&rft_id=info:doi/10.1007%2Fs00224-009-9190-x&rft.externalDocID=10_1007_s00224_009_9190_x |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-4350&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-4350&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-4350&client=summon |