Pages that link to "Item:Q3756533"
From MaRDI portal
The following pages link to A Simple Parallel Algorithm for the Maximal Independent Set Problem (Q3756533):
Displaying 50 items.
- Fast parallel constraint satisfaction (Q4630280) (← links)
- Scalable parallel graph coloring algorithms (Q4790880) (← links)
- A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH (Q4820076) (← links)
- <i>o</i>(log<sup>4</sup> <i>n</i>) time parallel maximal matching algorithm using linear number of processors (Q4826117) (← links)
- Restricted additive Schwarz methods for Markov chains (Q4897515) (← links)
- A probing method for computing the diagonal of a matrix inverse (Q4922262) (← links)
- Sublinear Graph Approximation Algorithms (Q4933367) (← links)
- (Q4941822) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- Fully dynamic MIS in uniformly sparse graphs (Q5002774) (← links)
- Introduction to local certification (Q5024672) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- Low-diameter graph decomposition is in NC (Q5056131) (← links)
- An efficient parallel algebraic multigrid method for 3D injection moulding simulation based on finite volume method (Q5071897) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Equilibria of Games in Networks for Local Tasks (Q5091077) (← links)
- (Q5091162) (← links)
- (Q5091249) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- (Probabilistic) recurrence relations revisited (Q5096333) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- Design and Implementation of a Parallel Markowitz Threshold Algorithm (Q5112242) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- A Highly Parallel Multilevel Newton--Krylov--Schwarz Method with Subspace-Based Coarsening and Partition-Based Balancing for the Multigroup Neutron Transport Equation on Three-Dimensional Unstructured Meshes (Q5131970) (← links)
- A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications (Q5161758) (← links)
- Polynomial hash functions are reliable (Q5204320) (← links)
- (Q5212563) (← links)
- A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows (Q5241250) (← links)
- An Adaptive Multigrid Method Based on Path Cover (Q5241251) (← links)
- Algebraic interface‐based coarsening AMG preconditioner for multi‐scale sparse matrices with applications to radiation hydrodynamics computation (Q5271014) (← links)
- A parallel algorithm for computing the critical independence number and related sets (Q5415703) (← links)
- A family of constrained pressure residual preconditioners for parallel reservoir simulations (Q5739754) (← links)
- (Q5743464) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- (Q5875468) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Structuring unreliable radio networks (Q5919151) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
