Pages that link to "Item:Q4729373"

The following pages link to Constructing a Maximal Independent Set in Parallel (Q4729373):

Displaying 18 items.

• Using maximal independent sets to solve problems in parallel (Q672378) (← links)
• The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
• Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
• An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
• Approximating matchings in parallel (Q1261482) (← links)
• Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
• Fast parallel constraint satisfaction (Q1313952) (← links)
• The maximum clique problem (Q1318271) (← links)
• An optimal parallel algorithm for maximal matching (Q1341686) (← links)
• A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
• Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects (Q2273354) (← links)
• On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
• AN EFFICIENT NC ALGORITHM FOR APPROXIMATE MAXIMUM WEIGHT MATCHING (Q2864855) (← links)
• OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
• Fast parallel constraint satisfaction (Q4630280) (← links)
• Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)