Matches in SemOpenAlex for { <https://semopenalex.org/work/W4366958325> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W4366958325 endingPage "398" @default.
- W4366958325 startingPage "383" @default.
- W4366958325 abstract "In this paper, we consider the problem of clustering graph nodes and sparsifying graph edges over distributed graphs, when graph edges with possibly edge duplicates are observed at physically remote sites. Although edge duplicates across different sites appear to be beneficial at the first glance, in fact they could make the clustering and sparsification more complicated since potentially their processing would need extra computations and communications. We propose the first communication-optimal algorithms for two well-established communication models namely the message passing and the blackboard models. Specifically, given a graph on n nodes with edges observed at s sites, our algorithms achieve communication costs $$tilde{O}(ns)$$ and $$tilde{O}(n+s)$$ ( $$tilde{O}$$ hides a polylogarithmic factor), which almost match their lower bounds, $$varOmega (ns)$$ and $$varOmega (n+s)$$ , in the message passing and the blackboard models respectively. The communication costs are asymptotically the same as those under non-duplication models, under an assumption on edge distribution. Our algorithms can also guarantee clustering quality nearly as good as that of centralizing all edges and then applying any standard clustering algorithm. Moreover, we perform the first investigation of distributed constructions of graph spanners in the blackboard model. We provide almost matching communication lower and upper bounds for both multiplicative and additive spanners. For example, the communication lower bounds of constructing a $$(2k-1)$$ -spanner in the blackboard with and without duplication models are $$varOmega (s+n^{1+1/k}log s)$$ and $$varOmega (s+n^{1+1/k}max {1,s^{-1/2-1/(2k)}log s})$$ respectively, which almost match the upper bound $$tilde{O}(s+n^{1+1/k})$$ for both models." @default.
- W4366958325 created "2023-04-26" @default.
- W4366958325 creator A5055242074 @default.
- W4366958325 date "2023-01-01" @default.
- W4366958325 modified "2023-10-10" @default.
- W4366958325 title "Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models" @default.
- W4366958325 cites W1983193888 @default.
- W4366958325 cites W2002041206 @default.
- W4366958325 cites W2019040312 @default.
- W4366958325 cites W2045446569 @default.
- W4366958325 cites W2099237198 @default.
- W4366958325 cites W2129575457 @default.
- W4366958325 cites W2167099561 @default.
- W4366958325 cites W2227069303 @default.
- W4366958325 cites W2494849242 @default.
- W4366958325 cites W2509547575 @default.
- W4366958325 cites W2568405002 @default.
- W4366958325 cites W2962990519 @default.
- W4366958325 cites W2985434080 @default.
- W4366958325 cites W3002117425 @default.
- W4366958325 cites W3032246104 @default.
- W4366958325 cites W3170407035 @default.
- W4366958325 cites W4214510568 @default.
- W4366958325 doi "https://doi.org/10.1007/978-3-031-30448-4_27" @default.
- W4366958325 hasPublicationYear "2023" @default.
- W4366958325 type Work @default.
- W4366958325 citedByCount "0" @default.
- W4366958325 crossrefType "book-chapter" @default.
- W4366958325 hasAuthorship W4366958325A5055242074 @default.
- W4366958325 hasBestOaLocation W43669583252 @default.
- W4366958325 hasConcept C11413529 @default.
- W4366958325 hasConcept C114614502 @default.
- W4366958325 hasConcept C118615104 @default.
- W4366958325 hasConcept C132525143 @default.
- W4366958325 hasConcept C134306372 @default.
- W4366958325 hasConcept C151319957 @default.
- W4366958325 hasConcept C154945302 @default.
- W4366958325 hasConcept C173608175 @default.
- W4366958325 hasConcept C199360897 @default.
- W4366958325 hasConcept C24858836 @default.
- W4366958325 hasConcept C2778308757 @default.
- W4366958325 hasConcept C31258907 @default.
- W4366958325 hasConcept C33923547 @default.
- W4366958325 hasConcept C41008148 @default.
- W4366958325 hasConcept C42747912 @default.
- W4366958325 hasConcept C73555534 @default.
- W4366958325 hasConcept C77553402 @default.
- W4366958325 hasConcept C80444323 @default.
- W4366958325 hasConcept C854659 @default.
- W4366958325 hasConceptScore W4366958325C11413529 @default.
- W4366958325 hasConceptScore W4366958325C114614502 @default.
- W4366958325 hasConceptScore W4366958325C118615104 @default.
- W4366958325 hasConceptScore W4366958325C132525143 @default.
- W4366958325 hasConceptScore W4366958325C134306372 @default.
- W4366958325 hasConceptScore W4366958325C151319957 @default.
- W4366958325 hasConceptScore W4366958325C154945302 @default.
- W4366958325 hasConceptScore W4366958325C173608175 @default.
- W4366958325 hasConceptScore W4366958325C199360897 @default.
- W4366958325 hasConceptScore W4366958325C24858836 @default.
- W4366958325 hasConceptScore W4366958325C2778308757 @default.
- W4366958325 hasConceptScore W4366958325C31258907 @default.
- W4366958325 hasConceptScore W4366958325C33923547 @default.
- W4366958325 hasConceptScore W4366958325C41008148 @default.
- W4366958325 hasConceptScore W4366958325C42747912 @default.
- W4366958325 hasConceptScore W4366958325C73555534 @default.
- W4366958325 hasConceptScore W4366958325C77553402 @default.
- W4366958325 hasConceptScore W4366958325C80444323 @default.
- W4366958325 hasConceptScore W4366958325C854659 @default.
- W4366958325 hasLocation W43669583251 @default.
- W4366958325 hasLocation W43669583252 @default.
- W4366958325 hasOpenAccess W4366958325 @default.
- W4366958325 hasPrimaryLocation W43669583251 @default.
- W4366958325 hasRelatedWork W1561560534 @default.
- W4366958325 hasRelatedWork W2076699371 @default.
- W4366958325 hasRelatedWork W2332010632 @default.
- W4366958325 hasRelatedWork W2904475383 @default.
- W4366958325 hasRelatedWork W2955482447 @default.
- W4366958325 hasRelatedWork W3034333085 @default.
- W4366958325 hasRelatedWork W3208948601 @default.
- W4366958325 hasRelatedWork W4283814387 @default.
- W4366958325 hasRelatedWork W4289827893 @default.
- W4366958325 hasRelatedWork W4366958325 @default.
- W4366958325 isParatext "false" @default.
- W4366958325 isRetracted "false" @default.
- W4366958325 workType "book-chapter" @default.