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.
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains (Q2283837) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- An analysis framework for distributed hierarchical directories (Q2346963) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Coloring unstructured radio networks (Q2377260) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
- Beeping a maximal independent set (Q2441534) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Cost-sharing mechanisms for network design (Q2471805) (← links)
- Algebraic multigrid methods for elastic structures with highly discontinuous coefficients (Q2479428) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- Reducing complexity of algebraic multigrid by aggregation. (Q2829109) (← links)
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication (Q2833530) (← links)
- Robust characterizations of \(k\)-wise independence over product spaces and related testing results (Q2856576) (← links)
- A fine-grained analysis of a simple independent set algorithm (Q2920136) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732) (← links)
- On long-range interpolation operators for aggressive coarsening (Q3094592) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size (Q3136616) (← links)
- Graph Coloring Using GPUs (Q3297570) (← links)
- (Q3349963) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES (Q3430330) (← links)
- AmgX: A Library for GPU Accelerated Algebraic Multigrid and Preconditioned Iterative Methods (Q3449799) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- Probabilistic analysis of a parallel algorithm for finding maximal independent sets (Q3489456) (← links)
- Leveraging Linial’s Locality Limit (Q3540245) (← links)
- A neural network graph partitioning procedure for grid-based domain decomposition (Q4267097) (← links)
- Parallel algorithms for routing in nonblocking networks (Q4277375) (← links)
- Threshold Functions for <i>H</i>-factors (Q4290084) (← links)
- Local-Global Phenomena in Graphs (Q4290099) (← links)
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005) (← links)
- IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (Q4485123) (← links)
- Parallel multigrid solvers for 3D unstructured finite element problems in large deformation elasticity and plasticity (Q4500197) (← links)
- An Improved Distributed Algorithm for Maximal Independent Set (Q4575597) (← links)
- Algebraic multigrid methods (Q4594246) (← links)
