No article text was recorded for this version.
graph-coloring-based parallelization
Version 1 of 122 papers38 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs
- Blog: An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
- Blog: MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
- Blog: DAPD: Dependency-Aware Parallel Decoding via Attention for Diffusion LLMs
- Blog: Decentralized Dynamic Power Management with Local Information
- Blog: D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- Blog: Vertex Block Descent
- Blog: Parallel Chromatic MCMC with Spatial Partitioning
- Blog: Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems
- Blog: Near-linear convergence of the Random Osborne algorithm for Matrix Balancing
- Blog: Adaptive Fog Configuration for the Industrial Internet of Things
- Blog: Distributed Optimization With Local Domains: Applications in MPC and Network Flows
- Blog: Improving Structured Grid-Based Sparse Matrix-Vector Multiplication and Gauss–Seidel Iteration on GPDSP
- Blog: Parallel multi-stage preconditioners with adaptive setup for the black oil model
- Blog: Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
- Blog: Scalable Distance-based Multi-Agent Relative State Estimation via Block Multiconvex Optimization
- Blog: Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing
- Blog: Parallel Chromatic MCMC with Spatial Partitioning
- Blog: Distributed Basis Pursuit
- Blog: Accelerating Triangle Counting with Real Processing-in-Memory Systems
- Blog: Scaling Up Coordinate Descent Algorithms for Large
- Blog: Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate Factorization
History & citation
Current · Permanent link
- This direction split from Parallelizing Iterative Solvers with Chromatic Scheduling (77% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_graph_coloring_based_parallelization_23c931df,
title = {graph-coloring-based parallelization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-coloring-based-parallelization/rdr_23c931dfb7064dc5a5c021915294d0d8},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_graph_coloring_based_parallelization_23c931df_v1,
title = {graph-coloring-based parallelization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/graph-coloring-based-parallelization/rdr_23c931dfb7064dc5a5c021915294d0d8/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}