Image de couverture de livre

Fast and Space-Efficient Parallel Algorithms for Influence Maximization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Letong, Ding, Xiangyun, Gu, Yan, Sun, Yihan
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

PASGAL: Parallel And Scalable Graph Algorithm Library
par: Dong, Xiaojun, et autres
Publié: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
par: Ding, Xiangyun, et autres
Publié: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
par: Wan, Zijin, et autres
Publié: (2024)

Parallel Integer Sort: Theory and Practice
par: Dong, Xiaojun, et autres
Publié: (2024)

Parallel $k$-Core Decomposition: Theory and Practice
par: Liu, Youzhe, et autres
Publié: (2025)

Parallel Point-to-Point Shortest Paths and Batch Queries
par: Dong, Xiaojun, et autres
Publié: (2025)

Parallel Joinable B-Trees in the Fork-Join I/O Model
par: Goodrich, Michael, et autres
Publié: (2025)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
par: Wu, Hanjiang, et autres
Publié: (2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
par: Dhulipala, Laxman, et autres
Publié: (2024)

Parallel Dynamic Maximal Matching
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Parallel $k$d-tree with Batch Updates
par: Men, Ziyang, et autres
Publié: (2024)

Parallel Batch-Dynamic Maximal Independent Set
par: Blelloch, Guy, et autres
Publié: (2026)

Efficient Enumeration of Large Maximal k-Plexes
par: Cheng, Qihao, et autres
Publié: (2024)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
par: Blelloch, Guy E., et autres
Publié: (2025)

Parallel Algorithms for Hierarchical Nucleus Decomposition
par: Shi, Jessica, et autres
Publié: (2023)

Encoding Schemes for Parallel In-Place Algorithms
par: Hutton, Chase, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

Designing Parallel Algorithms for Community Detection using Arachne
par: Li, Fuhuan, et autres
Publié: (2025)

Parallel Algorithms for the One Sided Crossing Minimization Problem
par: Popa, Bogdan-Ioan, et autres
Publié: (2025)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
par: De Man, Quinten, et autres
Publié: (2025)

Energy-Efficient Maximal Independent Sets in Radio Networks
par: Banasik, Dominick, et autres
Publié: (2025)

A Parallel Scan Algorithm in the Tensor Core Unit Model
par: Zouzias, Anastasios, et autres
Publié: (2024)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
par: Gopal, Shivaram, et autres
Publié: (2024)

Two Efficient Message-passing Exclusive Scan Algorithms
par: Träff, Jesper Larsson
Publié: (2026)

Dynamic Maximal Matching in Clique Networks
par: Li, Minming, et autres
Publié: (2024)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
par: Chang, Yi-Jun
Publié: (2023)

When MIS and Maximal Matching are Easy in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Parallel Scan on Ascend AI Accelerators
par: Wróblewski, Bartłomiej, et autres
Publié: (2025)

Massively Parallel Maximum Coverage Revisited
par: Bui, Thai, et autres
Publié: (2024)

Massively Parallel Ruling Set Made Deterministic
par: Giliberti, Jeff, et autres
Publié: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
par: Latypov, Rustam, et autres
Publié: (2024)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
par: Karmegam, Arivarasan, et autres
Publié: (2026)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
par: Yang, Mingqi
Publié: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
par: Liu, Quanquan C., et autres
Publié: (2024)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
par: Liu, Quanquan C., et autres
Publié: (2024)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)