Matches in SemOpenAlex for { <https://semopenalex.org/work/W2279679186> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2279679186 abstract "On an evolving graph that is continuously updated by a high-velocity stream of edges, how can one efficiently maintain if two vertices are connected? This is the connectivity problem, a fundamental and widely studied problem on graphs. We present the first shared-memory parallel algorithm for incremental graph connectivity that is both provably work-efficient and has polylogarithmic parallel depth. We also present a simpler algorithm with slightly worse theoretical properties, but which is easier to implement and has good practical performance. Our experiments show a throughput of hundreds of millions of edges per second on a $20$-core machine." @default.
- W2279679186 created "2016-06-24" @default.
- W2279679186 creator A5000538115 @default.
- W2279679186 creator A5009103211 @default.
- W2279679186 creator A5047034711 @default.
- W2279679186 creator A5054849628 @default.
- W2279679186 date "2016-02-16" @default.
- W2279679186 modified "2023-10-16" @default.
- W2279679186 title "Work-Efficient Parallel and Incremental Graph Connectivity" @default.
- W2279679186 cites W1482680420 @default.
- W2279679186 cites W1967695253 @default.
- W2279679186 cites W1976821017 @default.
- W2279679186 cites W1979201594 @default.
- W2279679186 cites W2013081353 @default.
- W2279679186 cites W2017148867 @default.
- W2279679186 cites W2023518480 @default.
- W2279679186 cites W2090523578 @default.
- W2279679186 cites W2120490947 @default.
- W2279679186 cites W2165753192 @default.
- W2279679186 cites W2395489635 @default.
- W2279679186 doi "https://doi.org/10.48550/arxiv.1602.05232" @default.
- W2279679186 hasPublicationYear "2016" @default.
- W2279679186 type Work @default.
- W2279679186 sameAs 2279679186 @default.
- W2279679186 citedByCount "1" @default.
- W2279679186 countsByYear W22796791862018 @default.
- W2279679186 crossrefType "posted-content" @default.
- W2279679186 hasAuthorship W2279679186A5000538115 @default.
- W2279679186 hasAuthorship W2279679186A5009103211 @default.
- W2279679186 hasAuthorship W2279679186A5047034711 @default.
- W2279679186 hasAuthorship W2279679186A5054849628 @default.
- W2279679186 hasBestOaLocation W22796791861 @default.
- W2279679186 hasConcept C11413529 @default.
- W2279679186 hasConcept C132525143 @default.
- W2279679186 hasConcept C173608175 @default.
- W2279679186 hasConcept C41008148 @default.
- W2279679186 hasConcept C80444323 @default.
- W2279679186 hasConceptScore W2279679186C11413529 @default.
- W2279679186 hasConceptScore W2279679186C132525143 @default.
- W2279679186 hasConceptScore W2279679186C173608175 @default.
- W2279679186 hasConceptScore W2279679186C41008148 @default.
- W2279679186 hasConceptScore W2279679186C80444323 @default.
- W2279679186 hasLocation W22796791861 @default.
- W2279679186 hasOpenAccess W2279679186 @default.
- W2279679186 hasPrimaryLocation W22796791861 @default.
- W2279679186 hasRelatedWork W1509211761 @default.
- W2279679186 hasRelatedWork W1558545464 @default.
- W2279679186 hasRelatedWork W1984303163 @default.
- W2279679186 hasRelatedWork W2006806489 @default.
- W2279679186 hasRelatedWork W2074301136 @default.
- W2279679186 hasRelatedWork W2117014006 @default.
- W2279679186 hasRelatedWork W2172791042 @default.
- W2279679186 hasRelatedWork W2358725432 @default.
- W2279679186 hasRelatedWork W2372170743 @default.
- W2279679186 hasRelatedWork W4233815414 @default.
- W2279679186 isParatext "false" @default.
- W2279679186 isRetracted "false" @default.
- W2279679186 magId "2279679186" @default.
- W2279679186 workType "article" @default.