Matches in SemOpenAlex for { <https://semopenalex.org/work/W3114868980> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W3114868980 endingPage "2891" @default.
- W3114868980 startingPage "2878" @default.
- W3114868980 abstract "Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGEST model of distributed computing. However, so far, very few tight bounds are known in this area. For triangle (i.e., 3-clique) listing, an optimal Õ(n1/3)-round distributed algorithm has been constructed by Chang et al. [SODA 2019, PODC 2019]. Recent works of Eden et al. [DISC 2019] and of Censor-Hillel et al. [PODC 2020] have shown sublinear algorithms for Kp-listing, for each p ≥ 4, but still leaving a significant gap between the upper bounds and the known lower bounds of the problem.In this paper, we completely close this gap. We show that for each p ≥ 4, there is an Õ(n1–2/p)-round distributed algorithm that lists all p-cliques Kp in the communication network. Our algorithm is optimal up to a polylogarithmic factor, due to the -round lower bound of Fischer et al. [SPAA 2018], which holds even in the CONGESTED CLIQUE model. Together with the triangle-listing algorithm by Chang et al. [SODA 2019, PODC 2019], our result thus shows that the round complexity of Kp-listing, for all p, is the same in both the CONGEST and CONGESTED CLIQUE models, at rounds.For p = 4, our result additionally matches the lower bound for K4-detection by Czumaj and Konrad [DISC 2018], implying that the round complexities for detection and listing of K4 are equivalent in the CONGEST model." @default.
- W3114868980 created "2021-01-05" @default.
- W3114868980 creator A5009353788 @default.
- W3114868980 creator A5011992745 @default.
- W3114868980 creator A5061279024 @default.
- W3114868980 creator A5061847213 @default.
- W3114868980 date "2021-01-01" @default.
- W3114868980 modified "2023-09-23" @default.
- W3114868980 title "Tight Distributed Listing of Cliques" @default.
- W3114868980 doi "https://doi.org/10.1137/1.9781611976465.171" @default.
- W3114868980 hasPublicationYear "2021" @default.
- W3114868980 type Work @default.
- W3114868980 sameAs 3114868980 @default.
- W3114868980 citedByCount "8" @default.
- W3114868980 countsByYear W31148689802021 @default.
- W3114868980 countsByYear W31148689802022 @default.
- W3114868980 crossrefType "book-chapter" @default.
- W3114868980 hasAuthorship W3114868980A5009353788 @default.
- W3114868980 hasAuthorship W3114868980A5011992745 @default.
- W3114868980 hasAuthorship W3114868980A5061279024 @default.
- W3114868980 hasAuthorship W3114868980A5061847213 @default.
- W3114868980 hasBestOaLocation W31148689801 @default.
- W3114868980 hasConcept C10138342 @default.
- W3114868980 hasConcept C11413529 @default.
- W3114868980 hasConcept C114614502 @default.
- W3114868980 hasConcept C117160843 @default.
- W3114868980 hasConcept C118615104 @default.
- W3114868980 hasConcept C120314980 @default.
- W3114868980 hasConcept C130120984 @default.
- W3114868980 hasConcept C134306372 @default.
- W3114868980 hasConcept C162324750 @default.
- W3114868980 hasConcept C2777035058 @default.
- W3114868980 hasConcept C2779820595 @default.
- W3114868980 hasConcept C33923547 @default.
- W3114868980 hasConcept C41008148 @default.
- W3114868980 hasConcept C77553402 @default.
- W3114868980 hasConceptScore W3114868980C10138342 @default.
- W3114868980 hasConceptScore W3114868980C11413529 @default.
- W3114868980 hasConceptScore W3114868980C114614502 @default.
- W3114868980 hasConceptScore W3114868980C117160843 @default.
- W3114868980 hasConceptScore W3114868980C118615104 @default.
- W3114868980 hasConceptScore W3114868980C120314980 @default.
- W3114868980 hasConceptScore W3114868980C130120984 @default.
- W3114868980 hasConceptScore W3114868980C134306372 @default.
- W3114868980 hasConceptScore W3114868980C162324750 @default.
- W3114868980 hasConceptScore W3114868980C2777035058 @default.
- W3114868980 hasConceptScore W3114868980C2779820595 @default.
- W3114868980 hasConceptScore W3114868980C33923547 @default.
- W3114868980 hasConceptScore W3114868980C41008148 @default.
- W3114868980 hasConceptScore W3114868980C77553402 @default.
- W3114868980 hasLocation W31148689801 @default.
- W3114868980 hasLocation W31148689802 @default.
- W3114868980 hasOpenAccess W3114868980 @default.
- W3114868980 hasPrimaryLocation W31148689801 @default.
- W3114868980 hasRelatedWork W2899640319 @default.
- W3114868980 hasRelatedWork W2963575629 @default.
- W3114868980 hasRelatedWork W2982308531 @default.
- W3114868980 hasRelatedWork W3020946092 @default.
- W3114868980 hasRelatedWork W3090130908 @default.
- W3114868980 hasRelatedWork W3102531933 @default.
- W3114868980 hasRelatedWork W3111591339 @default.
- W3114868980 hasRelatedWork W4225726351 @default.
- W3114868980 hasRelatedWork W4225966317 @default.
- W3114868980 hasRelatedWork W4297815966 @default.
- W3114868980 isParatext "false" @default.
- W3114868980 isRetracted "false" @default.
- W3114868980 magId "3114868980" @default.
- W3114868980 workType "book-chapter" @default.