Cover Image

Parallel Batch-Dynamic Maximal Independent Set

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blelloch, Guy, Brady, Andrew, Dhulipala, Laxman, Fineman, Jeremy, Lo, Jared
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
by: Blelloch, Guy E., et al.
Published: (2025)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
by: Dhulipala, Laxman, et al.
Published: (2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)

Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)

Towards Scalable and Practical Batch-Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

Big Atomics
by: Anderson, Daniel, et al.
Published: (2025)

Energy-Efficient Maximal Independent Sets in Radio Networks
by: Banasik, Dominick, et al.
Published: (2025)

Parallel Dynamic Maximal Matching
by: Ghaffari, Mohsen, et al.
Published: (2024)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
by: Bateni, MohammadHossein, et al.
Published: (2025)

CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
by: Wheatman, Brian, et al.
Published: (2023)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)

TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
by: Hutton, Chase, et al.
Published: (2025)

Parallel Point-to-Point Shortest Paths and Batch Queries
by: Dong, Xiaojun, et al.
Published: (2025)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
by: Liu, Quanquan C., et al.
Published: (2024)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023)

Fast Concurrent Primitives Despite Contention
by: Bender, Michael A., et al.
Published: (2026)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
by: Wu, Hanjiang, et al.
Published: (2024)

Massively Parallel Ruling Set Made Deterministic
by: Giliberti, Jeff, et al.
Published: (2024)

Distributed Reductions for the Maximum Weight Independent Set Problem
by: Borowitz, Jannick, et al.
Published: (2025)

It's Hard to HAC with Average Linkage!
by: Bateni, MohammadHossein, et al.
Published: (2024)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
by: Gil, Yuval
Published: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)

Parallel $k$d-tree with Batch Updates
by: Men, Ziyang, et al.
Published: (2024)

An Implementation and Experimental Comparison of Dynamic Ordered Sets
by: Malek, Jordan
Published: (2024)

History-Independent Concurrent Hash Tables
by: Attiya, Hagit, et al.
Published: (2025)

Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
by: Censor-Hillel, Keren, et al.
Published: (2023)

When MIS and Maximal Matching are Easy in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Parallel Scan on Ascend AI Accelerators
by: Wróblewski, Bartłomiej, et al.
Published: (2025)

Encoding Schemes for Parallel In-Place Algorithms
by: Hutton, Chase, et al.
Published: (2025)

Massively Parallel Maximum Coverage Revisited
by: Bui, Thai, et al.
Published: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
by: Latypov, Rustam, et al.
Published: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
by: Wan, Zijin, et al.
Published: (2024)