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.
- The maximum clique problem (Q1318271) (← links)
- A processor efficient MIS algorithm on random graphs (Q1318767) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Combinatorial techniques for universal hashing (Q1329163) (← links)
- An optimal parallel algorithm for maximal matching (Q1341686) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner (Q1349141) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
- A fast and efficient NC algorithm for maximal matching (Q1352118) (← links)
- On construction of \(k\)-wise independent random variables (Q1375059) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Probabilistic recurrence relations revisited (Q1391296) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Thread-parallel mesh improvement using face and edge swapping and vertex insertion (Q1615639) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- A bounded-risk mechanism for the kidney exchange game (Q1752443) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Variations on algebraic recursive multilevel solvers (ARMS) for the solution of CFD problems (Q1886271) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- A framework for automated distributed implementation of component-based models (Q1938379) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- New models and algorithms for RNA pseudoknot order assignment (Q2023637) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Loosely-stabilizing maximal independent set algorithms with unreliable communications (Q2089676) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Synthesizing optimal bias in randomized self-stabilization (Q2121058) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- Randomized distributed decision (Q2256969) (← links)
- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects (Q2273354) (← links)
