FRINK Linked Data Fragments server

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

• W4385580730 endingPage "35" @default.
• W4385580730 startingPage "1" @default.
• W4385580730 abstract "Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in real-world applications, efficient parallel algorithms are required. In this work, we propose scalable parallelisation of state-of-the-art sequential algorithms for enumerating simple, temporal, and hop-constrained cycles. First, we focus on the simple cycle enumeration problem and parallelise the algorithms by Johnson and by Read and Tarjan in a fine-grained manner. We theoretically show that our resulting fine-grained parallel algorithms are scalable, with the fine-grained parallel Read-Tarjan algorithm being strongly scalable. In contrast, we show that straightforward coarse-grained parallel versions of these simple cycle enumeration algorithms that exploit edge- or vertex-level parallelism are not scalable. Next, we adapt our fine-grained approach to enable the enumeration of cycles under time-window, temporal, and hop constraints. Our evaluation on a cluster with 256 CPU cores that can execute up to 1,024 simultaneous threads demonstrates a near-linear scalability of our fine-grained parallel algorithms when enumerating cycles under the aforementioned constraints. On the same cluster, our fine-grained parallel algorithms achieve, on average, one order of magnitude speedup compared to the respective coarse-grained parallel versions of the state-of-the-art algorithms for cycle enumeration. The performance gap between the fine-grained and the coarse-grained parallel algorithms increases as we use more CPU cores." @default.
• W4385580730 created "2023-08-05" @default.
• W4385580730 creator A5020575991 @default.
• W4385580730 creator A5058785461 @default.
• W4385580730 creator A5027902223 @default.
• W4385580730 date "2023-09-21" @default.
• W4385580730 modified "2023-10-03" @default.
• W4385580730 title "Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles" @default.
• W4385580730 cites W131619556 @default.
• W4385580730 cites W1945186739 @default.
• W4385580730 cites W1993608366 @default.
• W4385580730 cites W1996106086 @default.
• W4385580730 cites W2016559894 @default.
• W4385580730 cites W2016647770 @default.
• W4385580730 cites W2032401773 @default.
• W4385580730 cites W2038605146 @default.
• W4385580730 cites W2042086777 @default.
• W4385580730 cites W2043881783 @default.
• W4385580730 cites W2044920303 @default.
• W4385580730 cites W2045271686 @default.
• W4385580730 cites W2045299099 @default.
• W4385580730 cites W2053957335 @default.
• W4385580730 cites W2080098453 @default.
• W4385580730 cites W2083342911 @default.
• W4385580730 cites W2085103591 @default.
• W4385580730 cites W2085449715 @default.
• W4385580730 cites W2085806398 @default.
• W4385580730 cites W2130566259 @default.
• W4385580730 cites W2152651316 @default.
• W4385580730 cites W2153126872 @default.
• W4385580730 cites W2270949707 @default.
• W4385580730 cites W2281218127 @default.
• W4385580730 cites W2495638761 @default.
• W4385580730 cites W2526931032 @default.
• W4385580730 cites W2761683778 @default.
• W4385580730 cites W2767970464 @default.
• W4385580730 cites W2885630443 @default.
• W4385580730 cites W2889320527 @default.
• W4385580730 cites W2890101900 @default.
• W4385580730 cites W2980711752 @default.
• W4385580730 cites W2997619488 @default.
• W4385580730 cites W2998789694 @default.
• W4385580730 cites W3011254058 @default.
• W4385580730 cites W3066741709 @default.
• W4385580730 cites W3080134346 @default.
• W4385580730 cites W3084947387 @default.
• W4385580730 cites W3088940894 @default.
• W4385580730 cites W3098402231 @default.
• W4385580730 cites W3099369398 @default.
• W4385580730 cites W3101251439 @default.
• W4385580730 cites W3103967557 @default.
• W4385580730 cites W4229634034 @default.
• W4385580730 cites W631140850 @default.
• W4385580730 cites W653088692 @default.
• W4385580730 doi "https://doi.org/10.1145/3611642" @default.
• W4385580730 hasPublicationYear "2023" @default.
• W4385580730 type Work @default.
• W4385580730 citedByCount "0" @default.
• W4385580730 crossrefType "journal-article" @default.
• W4385580730 hasAuthorship W4385580730A5020575991 @default.
• W4385580730 hasAuthorship W4385580730A5027902223 @default.
• W4385580730 hasAuthorship W4385580730A5058785461 @default.
• W4385580730 hasBestOaLocation W43855807301 @default.
• W4385580730 hasConcept C111472728 @default.
• W4385580730 hasConcept C11413529 @default.
• W4385580730 hasConcept C114614502 @default.
• W4385580730 hasConcept C120373497 @default.
• W4385580730 hasConcept C138885662 @default.
• W4385580730 hasConcept C156340839 @default.
• W4385580730 hasConcept C173608175 @default.
• W4385580730 hasConcept C2780586882 @default.
• W4385580730 hasConcept C33923547 @default.
• W4385580730 hasConcept C41008148 @default.
• W4385580730 hasConcept C48044578 @default.
• W4385580730 hasConcept C68339613 @default.
• W4385580730 hasConcept C77088390 @default.
• W4385580730 hasConceptScore W4385580730C111472728 @default.
• W4385580730 hasConceptScore W4385580730C11413529 @default.
• W4385580730 hasConceptScore W4385580730C114614502 @default.
• W4385580730 hasConceptScore W4385580730C120373497 @default.
• W4385580730 hasConceptScore W4385580730C138885662 @default.
• W4385580730 hasConceptScore W4385580730C156340839 @default.
• W4385580730 hasConceptScore W4385580730C173608175 @default.
• W4385580730 hasConceptScore W4385580730C2780586882 @default.
• W4385580730 hasConceptScore W4385580730C33923547 @default.
• W4385580730 hasConceptScore W4385580730C41008148 @default.
• W4385580730 hasConceptScore W4385580730C48044578 @default.
• W4385580730 hasConceptScore W4385580730C68339613 @default.
• W4385580730 hasConceptScore W4385580730C77088390 @default.
• W4385580730 hasFunder F4320320924 @default.
• W4385580730 hasIssue "3" @default.
• W4385580730 hasLocation W43855807301 @default.
• W4385580730 hasLocation W43855807302 @default.
• W4385580730 hasOpenAccess W4385580730 @default.
• W4385580730 hasPrimaryLocation W43855807301 @default.
• W4385580730 hasRelatedWork W1800827217 @default.
• W4385580730 hasRelatedWork W194688272 @default.
• W4385580730 hasRelatedWork W2075505565 @default.

• next