Pages that link to "Item:Q3835033"

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

Displaying 13 items.

• 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)
• Approximating weighted matchings in parallel (Q845697) (← links)
• A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
• An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
• The maximum clique problem (Q1318271) (← links)
• Finding optimal subgraphs by local search (Q1392027) (← 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)
• Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
• On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)