FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2807720788> ?p ?o ?g. }

• W2807720788 endingPage "22" @default.
• W2807720788 startingPage "1" @default.
• W2807720788 abstract "Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where k ≥2 machines jointly perform computations on graphs with n nodes (typically, n > k ). The input graph is assumed to be initially randomly partitioned among the k machines, a common implementation in many real-world systems. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation. Our main result is an (almost) optimal distributed randomized algorithm for graph connectivity. Our algorithm runs in Õ( n / k 2 ) rounds (Õ notation hides a polylog( n ) factor and an additive polylog( n ) term). This improves over the best previously known bound of Õ( n / k ) [Klauck et al., SODA 2015] and is optimal (up to a polylogarithmic factor) in light of an existing lower bound of Ω ˜ ( n / k 2 ). Our improved algorithm uses a bunch of techniques, including linear graph sketching, that prove useful in the design of efficient distributed graph algorithms. Using the connectivity algorithm as a building block, we then present fast randomized algorithms for computing minimum spanning trees, (approximate) min-cuts, and for many graph verification problems. All these algorithms take Õ( n / k 2 ) rounds and are optimal up to polylogarithmic factors. We also show an almost matching lower bound of Ω ˜ ( n / k 2 ) rounds for many graph verification problems by leveraging lower bounds in random-partition communication complexity." @default.
• W2807720788 created "2018-06-21" @default.
• W2807720788 creator A5070507440 @default.
• W2807720788 creator A5072734392 @default.
• W2807720788 creator A5089574654 @default.
• W2807720788 date "2018-03-31" @default.
• W2807720788 modified "2023-09-27" @default.
• W2807720788 title "Fast Distributed Algorithms for Connectivity and MST in Large Graphs" @default.
• W2807720788 cites W1497938971 @default.
• W2807720788 cites W1592346261 @default.
• W2807720788 cites W1945584931 @default.
• W2807720788 cites W1964089073 @default.
• W2807720788 cites W1975832752 @default.
• W2807720788 cites W1982792741 @default.
• W2807720788 cites W1987099434 @default.
• W2807720788 cites W1992996565 @default.
• W2807720788 cites W1997010704 @default.
• W2807720788 cites W2016289973 @default.
• W2807720788 cites W2040011014 @default.
• W2807720788 cites W2043522657 @default.
• W2807720788 cites W2045271686 @default.
• W2807720788 cites W2051586153 @default.
• W2807720788 cites W2063513700 @default.
• W2807720788 cites W2068888615 @default.
• W2807720788 cites W2069689700 @default.
• W2807720788 cites W2077371116 @default.
• W2807720788 cites W2083323175 @default.
• W2807720788 cites W2101014999 @default.
• W2807720788 cites W2107008873 @default.
• W2807720788 cites W2107805020 @default.
• W2807720788 cites W2107997203 @default.
• W2807720788 cites W2116269179 @default.
• W2807720788 cites W2138304862 @default.
• W2807720788 cites W2139535340 @default.
• W2807720788 cites W2144146806 @default.
• W2807720788 cites W2149067844 @default.
• W2807720788 cites W2153977620 @default.
• W2807720788 cites W2170616854 @default.
• W2807720788 cites W217817341 @default.
• W2807720788 cites W2240320246 @default.
• W2807720788 cites W2245672739 @default.
• W2807720788 cites W2255377757 @default.
• W2807720788 cites W2296407087 @default.
• W2807720788 cites W2399614914 @default.
• W2807720788 cites W2460118749 @default.
• W2807720788 cites W2488670996 @default.
• W2807720788 cites W2547779378 @default.
• W2807720788 cites W2570634592 @default.
• W2807720788 cites W2899702797 @default.
• W2807720788 cites W2962708242 @default.
• W2807720788 cites W2963420932 @default.
• W2807720788 cites W2963974406 @default.
• W2807720788 cites W4205300528 @default.
• W2807720788 doi "https://doi.org/10.1145/3209689" @default.
• W2807720788 hasPublicationYear "2018" @default.
• W2807720788 type Work @default.
• W2807720788 sameAs 2807720788 @default.
• W2807720788 citedByCount "13" @default.
• W2807720788 countsByYear W28077207882018 @default.
• W2807720788 countsByYear W28077207882019 @default.
• W2807720788 countsByYear W28077207882020 @default.
• W2807720788 countsByYear W28077207882021 @default.
• W2807720788 countsByYear W28077207882022 @default.
• W2807720788 countsByYear W28077207882023 @default.
• W2807720788 crossrefType "journal-article" @default.
• W2807720788 hasAuthorship W2807720788A5070507440 @default.
• W2807720788 hasAuthorship W2807720788A5072734392 @default.
• W2807720788 hasAuthorship W2807720788A5089574654 @default.
• W2807720788 hasBestOaLocation W28077207881 @default.
• W2807720788 hasConcept C11413529 @default.
• W2807720788 hasConcept C114614502 @default.
• W2807720788 hasConcept C118615104 @default.
• W2807720788 hasConcept C120314980 @default.
• W2807720788 hasConcept C128669082 @default.
• W2807720788 hasConcept C130120984 @default.
• W2807720788 hasConcept C132525143 @default.
• W2807720788 hasConcept C134306372 @default.
• W2807720788 hasConcept C134727501 @default.
• W2807720788 hasConcept C173608175 @default.
• W2807720788 hasConcept C203776342 @default.
• W2807720788 hasConcept C22149727 @default.
• W2807720788 hasConcept C311688 @default.
• W2807720788 hasConcept C33923547 @default.
• W2807720788 hasConcept C41008148 @default.
• W2807720788 hasConcept C45374587 @default.
• W2807720788 hasConcept C48903430 @default.
• W2807720788 hasConcept C77553402 @default.
• W2807720788 hasConcept C80444323 @default.
• W2807720788 hasConcept C854659 @default.
• W2807720788 hasConceptScore W2807720788C11413529 @default.
• W2807720788 hasConceptScore W2807720788C114614502 @default.
• W2807720788 hasConceptScore W2807720788C118615104 @default.
• W2807720788 hasConceptScore W2807720788C120314980 @default.
• W2807720788 hasConceptScore W2807720788C128669082 @default.
• W2807720788 hasConceptScore W2807720788C130120984 @default.
• W2807720788 hasConceptScore W2807720788C132525143 @default.
• W2807720788 hasConceptScore W2807720788C134306372 @default.
• W2807720788 hasConceptScore W2807720788C134727501 @default.

• next