Pages that link to "Item:Q3756533"

The following pages link to A Simple Parallel Algorithm for the Maximal Independent Set Problem (Q3756533):

Displaying 50 items.

• Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
• Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
• Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
• Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
• Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
• Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
• A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
• On possible dependence structures of a set of random variables (Q452848) (← links)
• Revisiting iterated attacks in the context of decorrelation theory (Q458736) (← links)
• Application of multilevel scheme and two level discretization for POD based model order reduction of nonlinear transient heat transfer problems (Q487928) (← links)
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
• Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
• Bounds on contention management algorithms (Q553351) (← links)
• Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains (Q598237) (← links)
• Distributed approximation of capacitated dominating sets (Q613113) (← links)
• Visual cryptography on graphs (Q626454) (← links)
• An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
• Distributed discovery of large near-cliques (Q661050) (← links)
• Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
• Using maximal independent sets to solve problems in parallel (Q672378) (← links)
• The fourth moment in Luby's distribution (Q672385) (← links)
• The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
• Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
• A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← links)
• Distributed algorithms for random graphs (Q888436) (← links)
• A P-complete graph partition problem (Q917313) (← links)
• Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
• Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
• An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm (Q1004316) (← links)
• Encryption modes with almost free message integrity (Q1021243) (← links)
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
• Almost \(k\)-wise independence versus \(k\)-wise independence (Q1028993) (← links)
• The complexity of parallel search (Q1106664) (← links)
• A fast parallel coloring of planar graphs with five colors (Q1108037) (← links)
• A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
• Local randomness in pseudorandom sequences (Q1180515) (← links)
• An introduction to randomized algorithms (Q1182319) (← links)
• An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
• Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
• Highly resilient correctors for polynomials (Q1199875) (← links)
• Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
• Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
• Fast parallel constraint satisfaction (Q1313952) (← links)
• Low diameter graph decompositions (Q1316650) (← links)
• The maximum clique problem (Q1318271) (← links)