Pages that link to "Item:Q3771607"

The following pages link to A fast parallel algorithm for the maximal independent set problem (Q3771607):

Displaying 50 items.

• Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
• Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• On possible dependence structures of a set of random variables (Q452848) (← links)
• Independent sets in graphs (Q501998) (← links)
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← 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)
• A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← links)
• A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
• On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
• Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
• A parallel algorithm for the maximal path problem (Q1100916) (← links)
• A random NC algorithm for depth first search (Q1104756) (← links)
• Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
• A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula (Q1199880) (← links)
• Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
• Fast parallel constraint satisfaction (Q1313952) (← links)
• The maximum clique problem (Q1318271) (← links)
• A processor efficient MIS algorithm on random graphs (Q1318767) (← links)
• A parallel algorithm for finding a triconnected component separator with an application (Q1339375) (← links)
• The probabilistic method yields deterministic parallel algorithms (Q1342858) (← 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)
• Improved algorithms via approximations of probability distributions (Q1582012) (← 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)
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects (Q2273354) (← links)
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
• On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
• The Hsu-Robbins-Erdös theorem for the maximum partial sums of quadruplewise independent random variables (Q2682680) (← links)
• Efficient computation of sparse structures (Q2820273) (← links)
• The complexity of the comparator circuit value problem (Q2828221) (← links)
• Robust characterizations of <i>k</i> -wise independence over product spaces and related testing results (Q2856576) (← links)
• OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
• Threshold Functions for <i>H</i>-factors (Q4290084) (← links)
• Local-Global Phenomena in Graphs (Q4290099) (← links)
• IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (Q4485123) (← links)
• The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
• Fast parallel constraint satisfaction (Q4630280) (← links)
• <i>o</i>(log⁴ <i>n</i>) time parallel maximal matching algorithm using linear number of processors (Q4826117) (← links)
• (Q4941822) (← links)
• Low-diameter graph decomposition is in NC (Q5056131) (← links)
• (Q5212563) (← links)
• A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS (Q5249021) (← links)
• Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
• Parallel approximation of optimization problems (Q6560202) (← links)
• Randomized parallel algorithms (Q6560203) (← links)